Succinct representations of graphs
Information and Control
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On limited nondeterminism and the complexity of the V-C dimension
Journal of Computer and System Sciences
Deciding the Vapnik-Ccaron;ervonenkis dimension is Sp3 -complete
Journal of Computer and System Sciences
Computing with Very Weak Random Sources
SIAM Journal on Computing
List decoding algorithms for certain concatenated codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Loss-less condensers, unbalanced expanders, and extractors
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The minimum equivalent DNF problem and shortest implicants
Journal of Computer and System Sciences
Minimum Propositional Proof Length is NP-Hard to Linearly Approximate
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
The Minimization Problem for Boolean Formulas
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
The Minimum Equivalent DNF Problem and Shortest Implicants
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Hardness of Approximating Minimization Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On the Complexity of Approximating the VC Dimension
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Approximability and completeness in the polynomial hierarchy
Approximability and completeness in the polynomial hierarchy
List decoding of error-correcting codes
List decoding of error-correcting codes
Hardness of approximation for quantum problems
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |