Polynomial-time Random Oracles, Nondeterministic Sublinear Time, and Boolean Function Complexity
We use resource-bounded measure to study nondeterministic sublinear time, random oracles that separate complexity classes, and complexity measures of Boolean functions. 1. Nondeterministic Sublinear Time. The measure hypothesis is a quantitative strengthening of the P ≠ NP conjecture which asserts t...
Saved in:
| Main Author: | |
|---|---|
| Format: | Dissertation |
| Language: | English |
| Published: |
ProQuest Dissertations & Theses
01.01.2018
|
| Subjects: | |
| ISBN: | 9780438395176, 0438395174 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!