The graph of multiplication is equivalent to counting
References (8)
- et al.
On uniformity within NC1
J. Comput. System Sci.
(1990) Bounded Arithmetic
(1986)Revision of Ph.D. Thesis
(1985)The Boolean formula value problem is in ALOGTIME
Proc. 19th Ann. ACM Symp. on Theory of Computing
(1987)- et al.
Constant depth reducibility
SIAM J. Comput.
(1984)
There are more references available in the full text version of this article.
Cited by (6)
A lower bound for integer multiplication on randomized ordered read-once branching programs
2003, Information and ComputationA bounded arithmetic AID for Frege systems
2000, Annals of Pure and Applied LogicChapter 17 Computation models and function algebras
1999, Studies in Logic and the Foundations of MathematicsEfficient data structures for Boolean functions
1994, Discrete MathematicsA lower bound for integer multiplication with read-once branching programs
1999, SIAM Journal on ComputingVTC <sup>0</sup>: A second-order theory for TC <sup>0</sup>
2004, Proceedings - Symposium on Logic in Computer Science
- ∗
Supported in part by NSF Grant DMS-8902480.
Copyright © 1992 Published by Elsevier B.V.