A note on one-way functions and polynomial-time isomorphisms
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The ismorphism conjecture fails relative to a random oracle
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the power of 1-way functions
CRYPTO '88 Proceedings on Advances in cryptology
Journal of the ACM (JACM)
The isomorphism conjecture fails relative to a random oracle
Journal of the ACM (JACM)
NP might not be as easy as detecting unique solutions
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Some facets of complexity theory and cryptography: A five-lecture tutorial
ACM Computing Surveys (CSUR)
Measure Theoretic Completeness Notions for the Exponential Time Classes
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
If P != NP Then Some Strongly Noninvertible Functions Are Invertible
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Theoretical Computer Science
One-way permutations and self-witnessing languages
Journal of Computer and System Sciences
Tight lower bounds on the ambiguity of strong, total, associative, one-way functions
Journal of Computer and System Sciences
A note on quadratic residuosity and UP
Information Processing Letters
Properties of uniformly hard languages
Information Processing Letters
Resource bounded immunity and simplicity
Theoretical Computer Science
If P ≠ NP then some strongly noninvertible functions are invertible
Theoretical Computer Science
Comparing reductions to NP-complete sets
Information and Computation
Autoreducibility, mitoticity, and immunity
Journal of Computer and System Sciences
Quantum cryptography: A survey
ACM Computing Surveys (CSUR)
SIGACT news complexity theory column 64
ACM SIGACT News
Properties of uniformly hard languages
Information Processing Letters
A note on quadratic residuosity and UP
Information Processing Letters
Strong reductions and isomorphism of complete sets
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Comparing reductions to NP-complete sets
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Autoreducibility, mitoticity, and immunity
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Autoreducibility of complete sets for log-space and polynomial-time reductions
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |