Derandomizing the isolation lemma and lower bounds for circuit size

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

Volumn 5171 LNCS, Issue , 2008, Pages 276-289

  Arvind, V ^a   Mukhopadhyay, Partha ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; CONTROL THEORY; DIFFRACTIVE OPTICAL ELEMENTS; LEARNING SYSTEMS; NETWORKS (CIRCUITS); OPTIMIZATION; POLYNOMIAL APPROXIMATION; POLYNOMIALS; STANDARDS; TESTING; WELL TESTING;

ARITHMETIC CIRCUITS; CIRCUIT LOWER BOUNDS; CIRCUIT SIZE; COMBINATORIAL OP-TIMIZATION PROBLEM; DE-RANDOMIZING; DERANDOMIZATION; LOWER BOUNDS; POLYNOMIAL DEGREES; POLYNOMIAL IDENTITY TESTING; POLYNOMIAL-TIME; RANDOMIZED ALGORITHMS; UPPER BOUNDS;

APPROXIMATION ALGORITHMS;

EID: 51849159624     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85363-3_23     Document Type: Conference Paper

References (19)

1. Agrawal, M.: Proving Lower Bounds Via Pseudo-random Generators. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 92-105. Springer, Heidelberg (2005)
2. Agrawal, M.: Rings and Integer Lattices in Computer Science. In: Barbados Workshop on Computational Complexity, Lecture no. 9 (2007)
3. Reinhardt, K., Allender, E.: Making Nondeterminism Unambiguous. SIAM J. Comput. 29(4), 1118-1131 (2000)
4. Allender, E., Reinhardt, K., Zhou, S.: Isolation, matching and counting uniform and nonuniform upper bounds. Journal of Computer and System Sciences 59(2), 164-181 (1999)
5. Arvind, V., Mukhopadhyay, P., Srinivasan, S.: New results on Noncommutative and Commutative Polynomial Identity Testing. In: Proceedings of the 23rd IEEE Conference on Computational Complexity (to appear, June 2008); Technical report version in ECCC report TR08-025 (2008)
6. Bogdanov, A., Wee, H.: More on Noncommutative Polynomial Identity Testing. In: Proc. of the 20th Annual Conference on Computational Complexity, pp. 92-99 (2005)
7. Chien, S., Sinclair, A.: Algebras with Polynomial Identities and Computing the Determinants. SIAM J. of Comput. 37(1), 252-266 (2007)
8. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
9. Impagliazzo, R., Kabanets, V., Wigderson, A.: In search of an easy witness: Exponential time vs. probabilistic polynomial time. Journal of Computer and System Sciences 65(4), 672-694 (2002)
10. Kabanets, V., Impagliazzo, R.: Derandomization of polynomial identity tests means proving circuit lower bounds. In: Proc. of the thirty-fifth annual ACM Sym. on Theory of computing, pp. 355-364 (2003)
11. Klivans, A.R., Spielman, D.A.: Randomness Efficient Identity Testing. In: Proceedings of the 33rd Symposium on Theory of Computing (STOC), pp. 216-223 (2001)
12. Mulmuley, K., Vazirani, U., Vazirani, V.: Matching is as easy as matrix inversion. In: Proc. of the nineteenth annual ACM conference on Theory of Computing, pp. 345-354. ACM Press, New York (1987)
13. Nisan, N.: Lower bounds for non-commutative computation. In: Proc. of the 23rd annual ACM Sym. on Theory of computing, pp. 410-418 (1991)
14. Narayanan, H., Saran, H., Vazirani, V.V.: Randomized Parallel Algorithms for Matroid Union and Intersection, With Applications to Arboresences and Edge-Disjoint Spanning Trees. SIAM J. Comput. 23(2), 387-397 (1994)
15. Raz, R., Shpilka, A.: Deterministic polynomial identity testing in non commutative models. Computational Complexity 14(1), 1-19 (2005)
16. Schwartz, J.T.: Fast Probabilistic algorithm for verification of polynomial identities. J. ACM 27(4), 701-717 (1980)
17. Straubing, H.: Finite automata, formal logic, and circuit complexity. In: Progress in Theoretical Computer Science, Birkhuser Boston Inc., Boston (1994)
18. Valiant, L.G., Vazirani, V.V.: NP is as Easy as Detecting Unique Solutions. Theor. Comput. Sci. 47(3), 85-93 (1986)
19. Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Proc. of the Int. Sym. on Symbolic and Algebraic Computation, pp. 216-226 (1979)