Linear transformations in Boolean complexity theory

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

Volumn 4497 LNCS, Issue , 2007, Pages 307-315

  Friedman, Joel ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Boolean circuit complexity; Cohomology; Linear transformations

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING;

BOOLEAN CIRCUIT COMPLEXITY; COHOMOLOGY; LINEAR TRANSFORMATIONS;

LOGIC CIRCUITS;

EID: 38149009542     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73001-9_32     Document Type: Conference Paper

References (9)

1. Arpe, J., Manthey, B.: Approximability of minimum and-circuits. Electronic Colloquium on Compuational Complexity, Report No. 45; also in Dagstuhl Seminar Proceedings 2006:603 (2006)
2. Ben-Or, M.: Lower bounds for algebraic computation trees. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (a.k.a. STOC 1983), pp. 80-86 (1983)
3. Dobkin, D., Lipton, R.J.: Multidimensional searching problems. SIAM J. Comput. 5(2), 181-186 (1976)
4. Friedman, J.: Cohomology of grothendieck topologies and lower bounds in boolean complexity, (to appear, 2005). http://www.math.ubc.ca/~jf, also http://arxiv.org/abs/cs/0512008
5. Friedman, J., Cohomology of grothendieck topologies and lower bounds in boolean complexity ii. (to appear, 2006). http://www.math.ubc.ca/~jf, also http://arxiv.org/abs/cs/0604024
6. Smale, S.: On the topology of algorithms. I. J. Complexity 3(2), 81-89 (1987)
7. Michael Steele, J., Yao, A.C.: Lower bounds for algebraic decision trees. J. Algorithms 3(1), 1-8 (1982)
8. Vazirani, V.V.: Approximation algorithms. Springer, Berlin (2001)
9. Wegener, I.: The complexity of Boolean functions. In: Wiley-Teubner Series in Computer Science, John Wiley & Sons Ltd, Chichester (1987)