983 search results - page 17 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
TOMS
1998
13 years 7 months ago
1998
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
It is widely suspected that Erdos-R
SODA
2012
ACM
11 years 10 months ago
2012
ACM
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
GLVLSI
1996
IEEE
13 years 12 months ago
1996
IEEE
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...