848 search results - page 49 / 170 » Randomness and the linear degrees of computability |
102
click to vote
MST
2010
14 years 10 months ago
2010
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
TCS
2002
14 years 11 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
We study the phenomenon of cognitive learning from an algorithmic standpoint. How does the brain effectively learn concepts from a small number of examples despite the fact that e...
120
click to vote
DAC
2008
ACM
15 years 1 months ago
2008
ACM
Model order reduction is an efficient technique to reduce the system complexity while producing a good approximation of the input-output behavior. However, the efficiency of reduc...