On the size of classes with weak membership properties
From MaRDI portal
Publication:1274925
DOI10.1016/S0304-3975(97)00114-XzbMath0912.68048MaRDI QIDQ1274925
Publication date: 12 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
resource-bounded measureP-selective setscheatable setseasily approximable setseasily countable setslocally self-reducible setsnear-testable setsnearly near-testable setsP-bi-immune setsP-multiselective sets
Related Items (1)
Cites Work
- Unnamed Item
- Almost everywhere high nonuniform complexity
- Almost every set in exponential time is P-bi-immune
- Process complexity and effective random tests
- Optimal Approximations and Polynomially Levelable Sets
- Near-Testable Sets
- On Sets with Efficient Implicit Membership Tests
- Polynomial Time Productivity, Approximations, and Levelability
- Analogues of semirecursive sets and effective reducibilities to the study of NP complexity
- Polynomial-Time Membership Comparable Sets
This page was built for publication: On the size of classes with weak membership properties