On membership comparable sets

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1998, Pages 2-7

  Sivakumar, D ^a  

^a UNIVERSITY OF HOUSTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

BIVARIATE POLYNOMIALS; MEMBERSHIP COMPARABLE; NOISY DATA; POLYNOMIAL-TIME COMPUTABLE FUNCTIONS; TECHNICAL TOOLS;

POLYNOMIAL APPROXIMATION;

EID: 0009354489     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.1998.694584     Document Type: Conference Paper

References (34)

1. [AA94] 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, pages 24-30, 1994.
2. [ALRS92] 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, pages 503-512, 1992.
3. [AS97] S. Arora and M. Sudan. Improved low-degree testing and its applications. In Proc. 29th Annual ACM Symposium on the Theory of Computing, 1997.
4. [AT98] V. Arvind and J. Torán. Sparse sets, approximable sets, and parallel queries to NP. Manuscript, 1998.
5. [Bei87a] R. Beigel. Query-limited Reducibilities. PhD thesis, Stanford University, 1987.
6. [Bei87b] R. Beigel. A structural theorem that depends quantitatively on the complexity of SAT. In Proc. 2nd Annual IEEE Conference on Structure in Complexity Theory, pages 28-32, 1987.
7. [Bei88] R. Beigel. NP-hard sets are p-superterse unless R = NP. Technical Report TR 4, Dept. of Computer Science, Johns Hopkins University, 1988.
8. [BFT97] H. Buhrman, L. Fortnow, and L. Torenvliet. Six hypotheses in search of a theorem. In Proc. 12th Annual IEEE Conference on Computational Complexity, pages 2-12, 1997.
9. [BKS94] R. Beigel, M. Kummer, and F. Stephan. Approximable sets. In Proc. 9th Annual IEEE Conference on Structure in Complexity Theory, pages 12-23, 1994.
10. [BKS94b] R. Beigel, M. Kummer, and F. Stephan. Quantifying the amount of verboseness. To appear in Information and Computation.
11. [BT96] H. Buhrman and L. Torenvliet. P-selective self-reducible sets: A new characterization of P. Journal of Computer and System Sciences, 53(2):210-217, 1996.
12. [CNS96] J. Cai, A. Naik, and D. Sivakumar. On the existence of hard sparse sets under weak reductions. In Proc. 13th Annual Symposiumon Theoretical Aspects of Computer Science, pages 307-318, 1996.
13. [Coo88] S. Cook. Short propositional formulas represent nondeterministic computations. Information Processing Letters, 26:269-270, 1988.
14. [COS75] S. Clarke, J. C. Owings, Jr., and J. Spriggs. Trees with full subtrees. In Proc. of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing, pages 169-172. Congressus Numerantium, No. XIV, Utilitas Math., Winnipeg, Manitoba, 1975.
15. [CS95] J. Cai and D. Sivakumar. The resolution of a Hartmanis conjecture. In Proc. 36th Annual IEEE Symposiumon Foundations of Computer Science, pages 362-373, 1995.
16. [CS97] J. Cai and D. Sivakumar. Resolution of Hartmanis' conjecture for NL-hard sparse sets. In Proc. 3rd AnnualConference in Combinatorics and Computation, 1997.
17. [ESY84] S. Even, A. Selman, and Y. Yacobi. The complexity of promise problems, with applications to public-key cryptography. Information and Control, 61:159-173, 1984.
18. [HHO+93] L. Hemachandra, A. Hoene, M. Ogiwara, A. Selman, T. Thierauf, and J. Wang. Selectivity. In Proc. 5th International Conference on Computing and Information, pages 55-59, 1993.
19. [HNOS96] E. Hemaspaandra, A. Naik, M. Ogihara, and A. Selman. P-selective sets, and reducing search to decision vs. self-reducibility. Journal of Computer and System Sciences, 53(2):194-209, 1996.
20. [Joc68] C. Jockush. Semirecursive sets and positive reducibility. Transactions of the AmericanMathematical Society, 131(2):420-436, 1968.
21. [Kal92] E. Kaltofen. Polynomial factorization 1987-1991. In I. Simon, editor, Proc. 1st Latin American Symposium on Theoretical Informatics, volume 583 of Lecture Notes in Computer Science, pages 294-313. Springer-Verlag, 1992.
22. [Ko83] K.-I. Ko. On self-reducibility and weak Pselectivity. Journal of Computer and System Sciences, 26:209-221, 1983.
23. [LLL82] A. Lenstra, H. Lenstra, and L. Lovász. Factoring polynomials with rational coefficients. Mathematische Annalen, 261:515-534, 1982.
24. [Mel96] 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, pages 88-96, 1996.
25. [Ogi94] M. Ogihara. Polynomial-time membership comparable sets. In Proc. 9th Annual IEEE Conference on Structure in Complexity Theory, pages 2-11, 1994.
26. [Ogi95] M. Ogihara. Sparse hard sets for P yield spaceefficient algorithms. In Proc. 36th Annual IEEE Symposiumon Foundations of Computer Science, pages 354-361, 1995.
27. [Rom95] S. Roman. Field Theory. Springer-Verlag, 1995.
28. [Sel79] A. Selman. P-selective sets, tally languages, and behavior of polynomial time reducibilities on NP. Mathematical Systems Theory, 13:55-65, 1979.
29. [Sel82] A. Selman. Reductions on NP and P-selective sets. Theoretical Computer Science, 19:287-304, 1982.
30. [Sud96] M. Sudan. Maximum likelihood decoding of Reed-Solomon codes. In Proc. 37th Annual IEEE Symposiumon Foundations of Computer Science, pages 164-172, 1996.
31. [Tod91] S. Toda. On polynomial-time truth-table reducibility of intractable sets to p-selective sets. Mathematical Systems Theory, 24:69-82, 1991.
32. [TTW94] T. Thierauf, S. Toda, and O.Watanabe. On sets bounded truth-table reducible to p-selective sets. In Proc. 11th Annual Symposium on Theoretical Aspects of Computer Science, volume 775 of Lecture Notes in Computer Science, pages 427-438. Springer-Verlag, 1994.
33. [vL91] J.H. van Lint. Introduction to Coding Theory. Springer-Verlag, 1991.
34. [VV86] L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47:85-93, 1986.