10988 search results - page 178 / 2198 » Algorithmic Folding Complexity |
148
Voted
COLT
2000
Springer
15 years 7 months ago
2000
Springer
The present paper deals with the averagecase complexity of various algorithms for learning univariate polynomials. For this purpose an appropriate framework is introduced. Based o...
118
click to vote
STOC
1996
ACM
15 years 7 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
124
click to vote
COCO
2009
Springer
15 years 7 months ago
2009
Springer
Every Boolean function on n variables can be expressed as a unique multivariate polynomial modulo p for every prime p. In this work, we study how the degree of a function in one c...
121
Voted
COCO
2006
Springer
15 years 7 months ago
2006
Springer
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
134
Voted
LATIN
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...