On membership comparable sets

Journal of Computer and System Sciences

Volumn 59, Issue 2, 1999, Pages 270-280

  Sivakumar, D ^a  

^a University of Houston ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

BIVARIATE POLYNOMIAL FACTORIZATION; MEMBERSHIP COMPARABLE SETS;

SET THEORY;

EID: 0032597112     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1653     Document Type: Article

References (39)

1. M. Agrawal and V. Arvind, Polynomial time truth-table reductions to P-selective sets, in Proc. 9th Annual IEEE Conference on Structure in Complexity Theory, 1994, pp. 24-30.
2. S. Ar, R. Lipton, R. Rubinfeld, and M. Sudan, Reconstructing algebraic functions from mixed data, in Proc. 33rd Annual IEEE Symposium on foundations of Computer Science, 1992, pp. 503-512.
3. Alon N., Spencer J. The Probabilistic Method. 1992;Wiley, New York.
4. Arora S., Sudan M. Improved low-degree testing and its applications. Proc. 29th Annual ACM Symposium on the Theory of Computing. 1997;. p. 485-495.
5. Arvind V., Torán J. Sparse sets, approximable sets, and parallel queries to NP. Proc. 16th Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science. 1563:1999;Springer-Verlag, New York/Berlin. p. 281-290.
6. Beigel R. Query-limited Reducibilities. 1987;Stanford University.
7. Beigel R. A structural theorem that depends quantitatively on the complexity of SAT. Proc. 2nd Annual IEEE Conference on Structure in Complexity Theory. 1987;. p. 28-32.
8. Beigel R. Technical Report. 1988.
9. Buhrman H., Fortnow L., Torenvliet L. Six hypotheses in search of a theorem. Proc. 12th Annual IEEE Conference on Computational Complexity. 1997;. p. 2-12.
10. Beigel R., Kummer M., Stephan F. Quantifying the amount of verboseness. Inform. and Comput. 118:1995;304-314.
11. R. Beigel, M. Kummer, and F. Stephan, Approximable sets, in Proc. 9th Annual IEEE Conference on Structure in Complexity Theory, 1994, pp. 12-23.
12. Buhrman H., Torenvliet L. P-selective self-reducible sets: A new characterization of P. J. Comp. System Sci. 53:1996;210-217.
13. Cai J., Hemachandra L. Enumerative counting is hard. Inform. and Comput. 92:1989;34-44.
14. J. Cai, A. Naik, and D. Sivakumar, On the existence of hard sparse sets under weak reductions, in Proc. 13th Annual Symposium on Theoretical Aspects of Computer Science, 1996, pp. 307-318.
15. Cai J., Ogihara M. Sparse sets versus complexity classes. Hemaspaandra L., Selman A. Complexity Theory Retrospective II. 1997;53-80 Springer-Verlag.
16. Cook S. Short propositional formulas represent nondeterministic computations. Inform. Process. Lett. 26:1988;269-270.
17. Clarke S., Owings J. C. Jr., Spriggs J. Trees with full subtrees. Proc. of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing. Congr. Numer. XIV. 1975;Utilitas Math. Winnipeg. p. 169-172.
18. J. Cai and D. Sivakumar, The resolution of a Hartmanis conjecture, in Proc. 36th Annual IEEE Symposium on Foundations of Computer Science, 1995, pp. 362-373. [To appear in the FOCS'95 special issue, J. Comput. System Sci.].
19. J. Cai and D. Sivakumar, The resolution of a Hartmanis conjecture, in Proc. 36th Annual IEEE Symposium on Foundations of Computer Science, 1995, pp. 362-373. [To appear in the FOCS'95 special issue, J. Comput. System Sci.].
20. J. Cai, and, D. Sivakumar, Resolution of Hartmanis' conjecture for NL-hard sparse sets, in, Proc. 3rd Annual Conference in Combinatorics and Computation, 1997. [To appear in the COCOON'97 special issue of Theoretical Computer Science].
21. Even S., Selman A., Yacobi Y. The complexity of promise problems, with applications to public-key cryptography. Inform. and Control. 61:1984;159-173.
22. L. Hemachandra, A. Hoene, M. Ogiwara, A. Selman, T. Thierauf, and J. Wang, Selectivity, in Proc. 5th International Conference on Computing and Information, 1993, pp. 55-59.
23. Hemaspaandra E., Naik A., Ogihara M., Selman A. P-selective sets, and reducing search to decision vs. self-reducibility. J. Comp. System Sci. 53:1996;194-209.
24. L. Hemaspaandra, and, L. Torenvliet, Semi-feasible computation, 1998. [To appear as a monograph].
25. Kaltofen E. Polynomial factorization 1987-1991. Simon I. Proc. 1st Latin American Symposium on Theoretical Informatics. Lecture Notes in Computer Science. 583:1992;294-313 Springer-Verlag.
26. Ko K.-I. On self-reducibility and weak P-selectivity. J. Comp. System Sci. 26:1983;209-221.
27. Lenstra A., Lenstra H., Lovász L. Factoring polynomials with rational coefficients. Math. Ann. 261:1982;515-534.
28. D. Van Melkebeek, Reducing P to a sparse set using a constant number of queries collapses P to L, in Proc. 11th Annual IEEE Conference on Computational Complexity, 1996, pp. 88-96.
29. M. Ogihara, Polynomial-time membership comparable sets, in Proc. 9th Annual IEEE Conference on Structure in Complexity Theory, 1994, pp. 2-11.
30. M. Ogihara, Sparse hard sets for P yield space-efficient algorithms, in Proc. 36th Annual IEEE Symposium on Foundations of Computer Science, 1995, pp. 354-361.
31. Sauer N. On the density of families of sets. J. Combin. Theory Ser. A. 13:1972;145-147.
32. Selman A. P-selective sets, tally languages, and behavior of polynomial time reducibilities on NP. Math. Systems Theory. 13:1979;55-65.
33. Selman A. Reductions on NP and P-selective sets. Theoret. Comput. Sci. 19:1982;287-304.
34. Shelah S. A combinatorial problem: Stability and order for models and theories in infinitary languages. Pacific J. Math. 41:1972;247-261.
35. M. Sudan, Maximum likelihood decoding of Reed-Solomon codes, in Proc. 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, pp. 164-172.
36. Toda S. On polynomial-time truth-table reducibility of intractable sets to p-selective sets. Math. Systems Theory. 24:1991;69-82.
37. Thierauf T., Toda S., Watanabe O. On sets bounded truth-table reducible to p-selective sets. Proc. 11th Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science. 775:1994;Springer-Verlag. p. 427-438.
38. J. H. van Lint, Introduction to Coding Theory, Springer-Verlag, 1991.
39. Valiant L., Vazirani V. NP is as easy as detecting unique solutions. Theoret. Comput. Sci. 47:1986;85-93.