Complexity Measures for Public-Key Cryptosystems
- J. Grollmann, A. Selman
- Computer Science, MathematicsSIAM journal on computing (Print)
- 1 April 1988
A general theory of public-key cryptography is developed that is based on the mathematical framework of complexity theory. Two related approaches are taken to the development of this theory, and th...
A Taxonomy of Complexity Classes of Functions
- A. Selman
- MathematicsJournal of computer and system sciences (Print)
- 1 April 1994
Comparison of polynomial-time reducibilities
Comparison of the polynomial-time-bounded reducibilities introduced by Cook [1] and Karp] leads naturally to the definition of several intermediate truth-tableredcibilities, and it is noted that all redu cibilities of this type which do not have obvious implication relationships are in fact distinct in a strong sense.
Quantitative Relativizations of Complexity Classes
- R. V. Book, T. Long, A. Selman
- Computer Science, MathematicsSIAM journal on computing (Print)
- 27 July 1984
This paper studies restrictions R on both the deterministic and also the nondeterministic polynomial time-bounded oracle machines such that the size of the set of strings queried by the oracle in computations of a machine on an input is bounded by aPolynomial in the length of the input.
Computability and Complexity Theory
Conise, focused materials cover the most fundamental concepts and results in the field of modern complexity theory, including the theory of NP-completeness, NP-hardness, the polynomial hierarchy, and complete problems for other complexity classes.
P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP
- A. Selman
- MathematicsInternational Colloquium on Automata, Languages…
- 16 July 1979
It is proved that for m every tally language set in NP there exists a polynomial time equivalent set inNP that is p-selective, and from this result it follows that if NEXT ~ DEXT, then polynometric time Turing and many-one reducibilities differ on NP.
Arithmetical Reducibilities I
- A. Selman
- Mathematics
- 1971
A 3D - reductibility relation is defined to be a transitive and reflexive relation & on sets of natural numbers, so that for every two sets A and B, A&B implies AeZ^. Two hierarchies of such…
Reductions on NP and P-Selective Sets
- A. Selman
- MathematicsTheoretical Computer Science
- 1 September 1982
...
...