Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference5 articles.
1. D. Barrington: Bounded-width polynomial-size branching programs recognize exactly those languages in NC,Proc. 18 th ACM STOC,1986.
2. R. Boppana, andM. Sipser: The complexity of finite function, preprint.
3. A. A. Razborov: Lower bounds on the size of bounded depth networks over a complete basis with logical addition,Matematischi Zametki 41:4, 598?607 (in Russian). English translation inMathematical Notes of the Academy of Sciences of the USSR 41:4, 333?338.
4. K. T. Smith: The uncertainty principle on groups,IMA Preprint Series # 402, 1988.
5. R. Smolensky: Algebraic methods in the theory of lower bounds for Boolean circuit complexity,Proc. 19 th ACM STOC,1987.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献