( en | de | ru )

 

Disambiguation of "Selman, Alan L."

Author of the publication

copydeleteadd this publication to your clipboard
One-Way Functions in Complexity Theory.

. MFCS, volume 452 of Lecture Notes in Computer Science, page 88-104. Springer, (1990)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alan L Nothnagle

Selman Wolpert

Selman Lubowski

Selman Kaya

Selman Kaya

 

Other publications of authors with the same name

Quantitative Relativizations of Complexity Classes., , and . SIAM J. Comput., 13 (3): 461-487 (1984)Computability and Complexity Theory, Second Edition., and . Texts in Computer Science Springer, (2011)Computability and Complexity Theory., and . Texts in Computer Science Springer, (2001)The Complexity of Disjoint Unions., , , and . Technical Report, 384. Department of Computer Science, (April 2006)Analogues of Semicursive Sets and Effective Reducibilities to the Study of NP Complexity. Inf. Control., 52 (1): 36-51 (January 1982)Editorial Statement.. Theory Comput. Syst., 34 (1): 1 (2001)Complexity Measures for Public-Key Cryptosystems., and . SIAM J. Comput., 17 (2): 309-335 (1988)P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility., , , and . J. Comput. Syst. Sci., 53 (2): 194-209 (1996)Some Observations on NP, Real Numbers and P-Selective Sets.. J. Comput. Syst. Sci., 23 (3): 326-332 (1981)Computing Solutions Uniquely Collapses the Polynomial Hierarchy, , , and . Electron. Colloquium Comput. Complex., (1996)