983 search results - page 70 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
COCO
2005
Springer
14 years 8 days ago
2005
Springer
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
COLT
2006
Springer
14 years 2 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
ISSS
1995
IEEE
14 years 1 months ago
1995
IEEE
higher levels of abstraction, due to the still increasing design complexities that can be expected in the near future. Behavioral synthesis can play a key role in this prospect, as...
DAC
1989
ACM
14 years 1 months ago
1989
ACM
We present an accurate and efficient method for extraction of parasitic capacitances in submicron integrated circuits. The method uses a 3-D finite element model in which the cond...
CSCLP
2008
Springer
14 years 3 days ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...