The quasilinear isomorphism challenge
ACM SIGACT News
NP might not be as easy as detecting unique solutions
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Information and Computation
Separability and one-way functions
Computational Complexity
Canonical disjoint NP-pairs of propositional proof systems
Theoretical Computer Science
Classes of representable disjoint NP-pairs
Theoretical Computer Science
The Shrinking Property for NP and coNP
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
The deduction theorem for strong propositional proof systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
The shrinking property for NP and coNP
Theoretical Computer Science
Disjoint NP-pairs from propositional proof systems
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Canonical disjoint NP-Pairs of propositional proof systems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Survey of disjoint NP-pairs and relations to propositional proof systems
Theoretical Computer Science
the informational content of canonical disjoint NP-pairs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |