Skip to main content


eCommons@Cornell

eCommons@Cornell >

Browsing by Author Hemachandra, Lane A.

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:   
Sort by: In order: Results/Page Authors/Record:
Showing results 1 to 10 of 10
PreviewIssue DateTitleAuthor(s)
Dec-1985The Boolean Hierarchy: Hardware over NPCai, Jin-yi; Hemachandra, Lane A.
Dec-1986Can P and NP Manufacture Randomness?Hemachandra, Lane A.
Apr-1986Complexity Classes Without Machines: On Complete Languages for UPHartmanis, Juris; Hemachandra, Lane A.
Jun-1987Counting in Structural Complexity TheoryHemachandra, Lane A.
Jun-1986Exact Counting is as Easy as Approximate CountingCai, Jin-yi; Hemachandra, Lane A.
Jan-1986One-Way Functions, Robustness, and the Non-Isomorphism of NP-Complete SetsHartmanis, Juris; Hemachandra, Lane A.
Jul-1987On Parity and Near-Testability: $P^{A} \neq NT^{A}$ With Probability 1Hemachandra, Lane A.
Dec-1986On RankingHemachandra, Lane A.
Oct-1985On Sparse Oracles Separating Feasible Complexity ClassesHartmanis, Juris; Hemachandra, Lane A.
Aug-1986The Sky is Falling: The Strong Exponential Hierarchy CollapsesHemachandra, Lane A.
Showing results 1 to 10 of 10

 

© 2014 Cornell University Library Contact Us