Oracles for structural properties: the isomorphism problem and public-key cryptography
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Complexity Measures For Public-Key CryptosystemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Natural Self-Reducible SetsSIAM Journal on Computing, 1988
- Complexity Measures for Public-Key CryptosystemsSIAM Journal on Computing, 1988
- Three results on the polynomial isomorphism of complete setsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Relativizations of Unambiguous and Random Polynomial Time ClassesSIAM Journal on Computing, 1986
- A note on one-way functions and polynomial-time isomorphismsPublished by Association for Computing Machinery (ACM) ,1986
- Some remarks on witness functions for nonpolynomial and noncomplete sets in NPTheoretical Computer Science, 1985
- On some natural complete operatorsTheoretical Computer Science, 1985
- Relativized Questions Involving Probabilistic AlgorithmsJournal of the ACM, 1982
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977