7 search results - page 1 / 2 » A note on dimensions of polynomial size circuits |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
In this paper, we use resource-bounded dimension theory to investigate polynomial size circuits. We show that for every i 0, P/poly has ith-order scaled p3 -strong dimension 0. W...
DAGSTUHL
2006
13 years 6 months ago
2006
Mundici considered the question of whether the interpolant of two propositional formulas of the form F G can always have a short circuit description, and showed that if this is t...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
We study the problem of polynomial identity testing (PIT) for depth 2 arithmetic circuits over matrix algebra. We show that identity testing of depth 3 (ΣΠΣ) arithmetic circuit...
ISTCS
1993
Springer
13 years 9 months ago
1993
Springer
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
ICCAD
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...