List decoding algorithms for certain concatenated codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
On the hardness of approximating N P witnesses
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
List Decoding from Erasures: Bounds and Code Constructions
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
List Decoding: Algorithms and Applications
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Computational complexity of computing a partial solution for the Graph Automorphism problems
Theoretical Computer Science
Chernoff-type direct product theorems
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Relating complete and partial solution for problems similar to graph automorphism
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
We consider the question: Is finding just a part of a solution easier than finding the full solution? For example, is finding only a small fraction of the bits in a satisfying assignment to a 3-CNF formula easier than computing the whole assignment?For several important problems in NP we show that obtaining only a small fraction of the solution is as hard as finding the full solution. This can be interpreted in two ways: On the positive side, it is enough to look for an efficient algorithm that only recovers a small part of the solution, in order to completely solve any of these problems. On the negative side, any partial solution to these problems may be hard to find. Some of our results can also be interpreted as robust proofs of membership.