( en | de | ru )

 

Disambiguation of "Hemachandra, Lane A."

Author of the publication

copydeleteadd this publication to your clipboard
Probabilistic Polynomial Time is Closed under Parity Reductions.

, , and . Inf. Process. Lett., 37 (2): 91-94 (1991)

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.

Lane Brooks

Alexander Lane

Sachithra Hemachandra

Jay Donald Lane

Herbert Lane

 

Other publications of authors with the same name

On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions., , and . FSTTCS, volume 560 of Lecture Notes in Computer Science, page 212-223. Springer, (1991)Algorithms from Complexity Theory: Polynominal-Time Operations for Complex Sets.. SIGAL International Symposium on Algorithms, volume 450 of Lecture Notes in Computer Science, page 221-231. Springer, (1990)On the Power of Parity Polynomial Time., and . Math. Syst. Theory, 23 (2): 95-106 (1990)Near-Testable Sets., , , and . SIAM J. Comput., 20 (3): 506-523 (1991)Probabilistic Polynomial Time is Closed under Parity Reductions., , and . Inf. Process. Lett., 37 (2): 91-94 (1991)On Sparse Oracles Separating Feasible Complexity Classes., and . STACS, volume 210 of Lecture Notes in Computer Science, page 321-333. Springer, (1986)Robust Machines Accept Easy Sets., and . Theor. Comput. Sci., 74 (2): 217-225 (1990)The Strong Exponential Hierarchy Collapses.. J. Comput. Syst. Sci., 39 (3): 299-322 (1989)On ranking.. SCT, page 103-117. IEEE Computer Society, (1987)On Generating Solved Instances of Computational Problems., , , , and . CRYPTO, volume 403 of Lecture Notes in Computer Science, page 297-310. Springer, (1988)