Sparse sets, approximable sets, and parallel queries to NP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1563, Issue , 1999, Pages 281-290

  Arvind, Vikraman ^a   Torán, Jacobo ^b  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^b UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

NP COMPLETE; PARALLEL QUERIES; POLYLOGARITHMIC; POLYNOMIAL-TIME; SPARSE SET; TRUTH TABLES;

POLYNOMIAL APPROXIMATION;

EID: 0345209763     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49116-3_26     Document Type: Conference Paper

References (20)

1. S. Ar, R. Lipton, R. Rubinfeld, and M. Sudan. Reconstructing algebraic functions from erroneous data. In Proc. 33rd Annual IEEE Symp. on Foundations of Computer Science, 503-512, 1992.
2. V. Arvind, J. Köbler and M. Mundhenk. Uppr bounds for the complexity of sparse and tally descriptions. In Mathematical Systems Theory, 29:63-94, 1996.
3. J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. Springer-Verlag, 1988.
4. R. Beigel, M. Kummer, and F. Stephan. Approximable sets. Information and Computation, 120(2):304-314, 1995.
5. L. Berman and J. Hartmanis. On isomorphisms and density of NP and other complete sets. SIAM Journal on Computing, 6(2):305-322, 1977.
6. H. Buhrman, L. Fortnow, and L. Torenvliet. Six hypotheses in search of a theorem. In Proc. 12th Annual IEEE Conference on Computational Complexity, 2-12, IEEE Computer Society Press, 1997.
7. H. Buhrman and M. Hermo. On the sparse set conjecture for sets with low density. In Proc. 12th Annual Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 900, 609-618, Springer Verlag 1995.
8. J. Y. Cai, A. Naik, and D. Sivakumar. On the existence of hard sparse sets under weak reductions. In Proc. 13th Annual Symp. on Theoretical Aspects of Computer Science, 307-318, 1996. See also the Technical Report 95-31 from the Dept. of Comp. Science and Engeneering, SUNY at Buálo (1995).
9. J. Y. Cai and M. Ogihara. Sparse sets versus complexity classes. Chapter in Complexity Theory Retrospective II, L. Hemaspaandra and A. Selman editors, Springer Verlag 1997.
10. J. Y. Cai and D. Sivakumar. The resolution of a Hartmanis conjecture. In Proc. 36th Foundations of Computer Science, 362-373, 1995.
11. S. Even, A. Selman, and Y. Yacobi. The complexity of promise problems with applications to public-key cryptography. Information and Control, 61:114-133, 1984.
12. B. Jenner and J. Tor_an. Computing functions with parallel queries to NP. Theoretical Computer Science, 141, 175-193, 1995.
13. R. M. Karp and R. J. Lipton. Some connections between nonuniform and uniform complexity classes. In Proc. 12th ACM Symposium on Theory of Computing, 302-309. ACM Press, 1980.
14. M. Ogihara. Polynomial-time membership comparable sets. SIAM Journal of Computing, 24(5):1168-1181, 1995.
15. M. Ogihara and O. Watanabe. On polynomial time bounded truth-table reducibility of NP sets to sparse sets. SIAM Journal on Computing 20(3):471-483 (1991).
16. C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
17. D. Sivakumar. On membership comparable sets. In Proc. 13th IEEE Computational Complexity Conference 1998, 2-8, IEEE Computer Society Press, 1998.
18. E. Ukkonen. Two results on polynomial time truth-table reductions to sparse sets. SIAM Journal on Computing, 12(3):580-587, 1983.
19. L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47:85-93,1986.
20. C. Yap. Some consequences of non-uniform conditions on uniform classes. Theoretical Computer Science, 26:287-300, 1983.