Sciweavers

467 search results - page 45 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
RANDOM
2001
Springer
15 years 4 months ago
Proclaiming Dictators and Juntas or Testing Boolean Formulae
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨©  ¤¥ ¦ §¨ belongs to a certain class of Boolean functions  or whether it is far from the...
Michal Parnas, Dana Ron, Alex Samorodnitsky
STOC
2010
ACM
168views Algorithms» more  STOC 2010»
15 years 9 months ago
Non-commutative circuits and the sum-of-squares problem
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
Pavel Hrubes, Avi Wigderson and Amir Yehudayoff
DAGSTUHL
2006
15 years 1 months ago
A note on the size of Craig Interpolants
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...
Uwe Schöning, Jacobo Torán
DAGSTUHL
2010
15 years 1 months ago
Exploring Visualization Methods for Complex Variables
Applications of complex variables and related manifolds appear throughout mathematics and science. Here we review a family of basic methods for applying visualization concepts to ...
Andrew J. Hanson, Ji-Ping Sha
SIAMDM
2002
124views more  SIAMDM 2002»
14 years 11 months ago
Counting Claw-Free Cubic Graphs
Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. Combinatorial reductions are used to derive a second order, linear homogeneous differential equation with polyno...
Edgar M. Palmer, Ronald C. Read, Robert W. Robinso...