|
eCommons@Cornell >
Browsing by Author Hemachandra, Lane A.
Showing results 1 to 10 of 10
| Preview | Issue Date | Title | Author(s) | | Dec-1985 | The Boolean Hierarchy: Hardware over NP | Cai, Jin-yi; Hemachandra, Lane A. |
| Dec-1986 | Can P and NP Manufacture Randomness? | Hemachandra, Lane A. |
| Apr-1986 | Complexity Classes Without Machines: On Complete Languages for UP | Hartmanis, Juris; Hemachandra, Lane A. |
| Jun-1987 | Counting in Structural Complexity Theory | Hemachandra, Lane A. |
| Jun-1986 | Exact Counting is as Easy as Approximate Counting | Cai, Jin-yi; Hemachandra, Lane A. |
| Jan-1986 | One-Way Functions, Robustness, and the Non-Isomorphism of NP-Complete Sets | Hartmanis, Juris; Hemachandra, Lane A. |
| Jul-1987 | On Parity and Near-Testability: $P^{A} \neq NT^{A}$ With Probability 1 | Hemachandra, Lane A. |
| Dec-1986 | On Ranking | Hemachandra, Lane A. |
| Oct-1985 | On Sparse Oracles Separating Feasible Complexity Classes | Hartmanis, Juris; Hemachandra, Lane A. |
| Aug-1986 | The Sky is Falling: The Strong Exponential Hierarchy Collapses | Hemachandra, Lane A. |
Showing results 1 to 10 of 10
|
