Optimal approximations of complete sets
- 1 January 1986
- book chapter
- Published by Springer Nature
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Optimal Approximations and Polynomially Levelable SetsSIAM Journal on Computing, 1986
- On one-one polynomial time equivalence relationsTheoretical Computer Science, 1985
- Nonlevelable sets and immune sets in the accepting density hierarchy inNPTheory of Computing Systems, 1985
- The structure of polynomial complexity coresPublished by Springer Nature ,1984
- Some structural properties of polynomial reducibilities and sets in NPPublished by Association for Computing Machinery (ACM) ,1983
- Completeness, Approximation and DensitySIAM Journal on Computing, 1981
- On Reducibility to Complex or Sparse SetsJournal of the ACM, 1975