On Parity and Near-Testability: $P^{A} \neq NT^{A}$ With Probability 1
| dc.contributor.author | Hemachandra, Lane A. | en_US |
| dc.date.accessioned | 2007-04-23T17:21:02Z | |
| dc.date.available | 2007-04-23T17:21:02Z | |
| dc.date.issued | 1987-07 | en_US |
| dc.description.abstract | The class of near-testable sets, NT, was defined by Goldsmith, Joseph, and Young. They noted that $P \subseteq NT \subseteq PSPACE$, and asked whether P=NT. This note shows that NT shares the same $m$-degree as the parity-based complexity class $\bigoplus P$ (i.e., $NT\equiv^{p}_{m} \oplus P$) and uses this to prove that relative to a random oracle $A, P^{A} \neq NT^{A}$ with probability one. Indeed, with probability one, $NT^{A} - (NP^{A} \bigcup coNP^{A}) \neq 0$. | en_US |
| dc.format.extent | 738466 bytes | |
| dc.format.extent | 199689 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-852 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6692 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | On Parity and Near-Testability: $P^{A} \neq NT^{A}$ With Probability 1 | en_US |
| dc.type | technical report | en_US |