Isolating an odd number of elements and applications in complexity theory

Theory of Computing Systems

Volumn 31, Issue 1, 1998, Pages 27-40

  Gupta, S ^a  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES;

BIT VECTOR; COMPLEXITY THEORY; PROBABILITY BOUND; RUNNING TIME; THRESHOLD CIRCUITS;

COMPUTATIONAL COMPLEXITY;

EID: 0032330819     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000075     Document Type: Article

References (26)

1. E. Allender and V. Gore. A uniform circuit lower bound for the permanent. SIAM J. Comput., 23:1026-1049, 1994.
2. E. Allender and U. Hertrampf. Depth reductions for circuits of unbounded fan-in. SIAM J. Comput., 112:217-238, 1994. An earlier version appears as: E. Allender, A note on the power of threshold circuits, Proc. 30th IEEE Symp. on Foundations of Computer Science, pages 580-584, 1989.
3. E. Allender and U. Hertrampf. Depth reductions for circuits of unbounded fan-in. SIAM J. Comput., 112:217-238, 1994. An earlier version appears as: E. Allender, A note on the power of threshold circuits, Proc. 30th IEEE Symp. on Foundations of Computer Science, pages 580-584, 1989.
4. R. Beigel and J. Tarui. On ACC. Comput. Complexity, 4:350-366, 1994. An earlier version appears as: On ACC in Proc. 32nd IEEE Symp. on Foundations of Computer Science, pages 783-792, 1991.
5. R. Beigel and J. Tarui. On ACC. Comput. Complexity, 4:350-366, 1994. An earlier version appears as: On ACC in Proc. 32nd IEEE Symp. on Foundations of Computer Science, pages 783-792, 1991.
6. J.L. Carter and M.N. Wegman. Universal classes of hash functions. J. Comput. System Sci., 18:143-154, 1979.
7. S. Chari. Randomness as a Computational Resource: Issues in Efficient Computation. Ph.D. thesis, Cornell University, August 1994.
8. S. Chari, P. Rohtagi, and A. Srinivasan. Randomness efficient unique element isolation with application to perfect matching and related problems. In Proc. 25th ACM Symp. on Theory of Computing, pages 458-467. Springer-Verlag, New York, 1993.
9. W. Feller. An Introduction to Probability Theory and Its Applications, volume 1. Wiley, New York, 1968.
10. S. Gupta. Determinism, Nondeterminism, Alternation and Counting. Ph.D. thesis, The Ohio State University, 1993.
11. Y. Mansour, N. Nisan, and P. Tiwari. The computational complexity of universal hashing. Theoret. Comput. Sci., 107:121-133, 1993.
12. K. Mulmuley, U.V. Vazirani, and V.V. Vazirani. Matching is as easy as matrix inversion. Combinatorica, 7(1):105-113, 1987.
13. J. Naor and M. Naor. Small-bias probability spaces: efficient constructions and applications. SIAM J. Comput., 22(4):838-856, 1993. An earlier version appears as: J. Naor and M. Naor, Small-bias probability spaces: efficient constructions and applications, in Proc. 22nd Annual ACM Symp. on Theory of Computing, pages 213-223, 1990.
14. J. Naor and M. Naor. Small-bias probability spaces: efficient constructions and applications. SIAM J. Comput., 22(4):838-856, 1993. An earlier version appears as: J. Naor and M. Naor, Small-bias probability spaces: efficient constructions and applications, in Proc. 22nd Annual ACM Symp. on Theory of Computing, pages 213-223, 1990.
15. A. Razborov. Lower bounds on the size of bounded depth networks over a complete basis with logical addition. Mat. Zametki, 41:598-607, 1987. An English translation appears in: Math. Notes 41:333-338, 1987.
16. A. Razborov. Lower bounds on the size of bounded depth networks over a complete basis with logical addition. Mat. Zametki, 41:598-607, 1987. An English translation appears in: Math. Notes 41:333-338, 1987.
17. K. Regan. Polynomials and combinatorial definitions of languages. In A. Selman and L. Hamaspaandra, editors, Complexity Theory Retrospective II. Springer-Verlag, New York, 1996.
18. R. Smolensky. Algebraic methods in the theory of lower bounds for boolean circuit complexity. In Proc. 19th ACM Symp. on Theory of Computing, pages 77-82, 1987.
19. J. Tarui. Randomized polynomials, threshold circuits, and the polynomial hierarchy. Theoret. Comput. Sci., 113:167-183, 1993. An earlier version appears in: Proc. 8th Annual Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, volume 480, Springer-Verlag, Berlin, 1991, pages 238-250.
20. J. Tarui. Randomized polynomials, threshold circuits, and the polynomial hierarchy. Theoret. Comput. Sci., 113:167-183, 1993. An earlier version appears in: Proc. 8th Annual Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, volume 480, Springer-Verlag, Berlin, 1991, pages 238-250.
21. S. Toda. PP is as hard as the polynomial-time hierarchy. SIAM J. Comput., 20:865-877, 1991. An earlier version appears as: S. Toda, On the computational power of PP and ⊕P, in: Proc. 30th IEEE Symp. on Foundations of Computer Science, pages 514-519, 1989.
22. S. Toda. PP is as hard as the polynomial-time hierarchy. SIAM J. Comput., 20:865-877, 1991. An earlier version appears as: S. Toda, On the computational power of PP and ⊕P, in: Proc. 30th IEEE Symp. on Foundations of Computer Science, pages 514-519, 1989.
23. S. Toda and M. Ogiwara. Counting classes are at least as hard as the the polynomial-time hierarchy. SIAM J. Comput., 21:316-328, 1992. An earlier version appears in: Proc. 6th Structure in Complexity Theory Conference, IEEE Computer Society Press, New York, pages 2-12.
24. S. Toda and M. Ogiwara. Counting classes are at least as hard as the the polynomial-time hierarchy. SIAM J. Comput., 21:316-328, 1992. An earlier version appears in: Proc. 6th Structure in Complexity Theory Conference, IEEE Computer Society Press, New York, pages 2-12.
25. L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. Theoret. Comput. Sci., 47:85-93, 1986.
26. A. Yao. On ACC and threshold circuits. In Proc. 31st IEEE Symp. on Foundations of Computer Science, pages 619-627, 1990.