Boolean complexity classes vs. their arithmetic analogs

Random Structures and Algorithms

Volumn 9, Issue 1, 1996, Pages 99-111

  Gál, Anna ^a   Wigderson, Avi ^b  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040940655     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199608/09)9:1/2<99::AID-RSA7>3.0.CO;2-6     Document Type: Article

References (22)

1. E. Allender and J. Jiao, Depth reduction for noncommutative arithmetic circuits, Proc. 25th STOC, 1993, pp. 515-522.
2. A. Borodin, On relating time and space to size and depth, SIAM J. Comput., 6, 733-744 (1977).
3. A. Borodin, personal communication (1988).
4. A. Borodin, S.A. Cook, P. W. Dymond, W. L. Ruzzo, and M. Tompa, Two applications of inductive counting for complementation problems, SIAM J. Comput., 18(3), 559-578 (1989).
5. G. Buntrock, C. Damm, H. Hertrampf, and C. Meinel, Structure and importance of the logspace-mod class, Math. Syst. Theor., 25, 223-237 (1992).
6. S. A. Cook, A taxonomy of problems with fast parallel algorithms, Inf. Control, 64, 2-22 (1985).
7. A. Gál, Semi-unbounded fan-in circuits: Boolean vs. arithmetic, Proc. 10th Annual Symposium on Structure in Complexity Theory, 1995, pp. 82-87.
8. N. Immerman, Upper and lower bounds on first order expressibility, J. Comput. Syst. Sci., 25, 76-98 (1982).
9. M. Karchmer and A. Wigderson, On span programs, Proc. 8th Annual Symposium on Structure in Complexity Theory, 1993, pp. 102-111.
10. K. Mulmuley, U. Vazirani, and V. Vazirani, Matching is as easy as matrix inversion, Proc. 19th STOC, 1987, pp. 345-354.
11. N. Nisan, personal communication (1995).
12. A. A. Razborov, Lower bounds for the size of circuits of bounded depth with basis {∧, ⊕}, Math. Notes Acad. Sci. USSR, 41(4), 333-338 (1987).
13. W. L. Ruzzo, Tree-size bounded alternation, J. Comput. Syst. Sci., 21, 218-235 (1980).
14. S. Skyum and L. G. Valiant, A complexity theory based on Boolean algebra, Proc. 22nd FOCS, 1981, pp. 244-253.
15. R. Smolensky, Algebraic methods in the theory of lower bounds for Boolean circuit complexity, Proc. 19th STOC, 1987, pp. 77-82.
16. I. H. Sudborough, On the tape complexity of deterministic context-free languages, J. Assoc. Comput. Mach., 25, 405-414 (1978).
17. L. G. Valiant and V. V. Vazirani, NP is as easy as detecting unique solutions, Ther. Comput. Sci. 47, 85-93 (1986).
18. H. Venkateswaran, Properties that characterize LOGCFL, Proc. 19th STOC, 1987, pp. 141-150.
19. H. Venkateswaran, personal communication (1995).
20. J. von zur Gathen, Algebraic complexity theory, Annu. Rev. Comput. Sci., 3, 317-347 (1988).
21. I. Wegner, The Complexity of Boolean Functions, Wiley-Teubner, New York, 1987.
22. A. Wigderson, NL/poly ⊆ ⊕ L/poly, Proc. 9th Conf. Structure in Complexity Theory, 1994, pp. 59-62.