( en | de | ru )

 

Disambiguation of "Selman, Alan L."

Author of the publication

copydeleteadd this publication to your clipboard
Redundancy in Complete Sets.

, , , and . STACS, volume 3884 of Lecture Notes in Computer Science, page 444-454. Springer, (2006)

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 Kaya

Selman Lubowski

Selman Kaya

 

Other publications of authors with the same name

Distributionally Hard Languages., , and . Theory Comput. Syst., 34 (3): 245-261 (2001)Complexity Classes for Partial Functions.. Current Trends in Theoretical Computer Science, volume 40 of World Scientific Series in Computer Science, World Scientific, (1993)Complexity Theory Retrospective. Springer, (1990)A Second Step Toward the Polynomial Hierarchy., and . Theor. Comput. Sci., (1979)Qualitative Relativizations of Complexity Classes., , and . J. Comput. Syst. Sci., 30 (3): 395-413 (1985)Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography., and . J. Comput. Syst. Sci., 44 (2): 287-301 (1992)A Survey of One-Way Functions in Complexity Theory.. Math. Syst. Theory, 25 (3): 203-221 (1992)P-selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP.. Math. Syst. Theory, (1979)The Complexity of Promise Problems., and . ICALP, volume 140 of Lecture Notes in Computer Science, page 502-509. Springer, (1982)On Using Oracles That Compute Values., , , and . STACS, volume 665 of Lecture Notes in Computer Science, page 398-407. Springer, (1993)