Optimal Approximations and Polynomially Levelable Sets
- 1 May 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 15 (2) , 399-408
- https://doi.org/10.1137/0215027
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Bi-immune sets for complexity classesTheory of Computing Systems, 1985
- The structure of polynomial complexity coresPublished by Springer Nature ,1984
- On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse SetsSIAM Journal on Computing, 1983
- On self-reducibility and weak P-selectivityJournal of Computer and System Sciences, 1983
- Completeness, Approximation and DensitySIAM Journal on Computing, 1981
- Computational complexity, speedable and levelable setsThe Journal of Symbolic Logic, 1977
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- On Reducibility to Complex or Sparse SetsJournal of the ACM, 1975
- On sets having only hard subsetsPublished by Springer Nature ,1974
- On complexity properties of recursively enumerable setsThe Journal of Symbolic Logic, 1973