514 search results - page 2 / 103 » On the Structure of Valiant's Complexity Classes |
93
Voted
CORR
2007
Springer
15 years 10 days ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
113
Voted
ECCC
2008
15 years 13 days ago
2008
We show analogues of a theorem due to Valiant and Vazirani [16] for intractable parameterized complexity classes such as W[P], W[SAT] and the classes of the W-hierarchy as well as...
83
Voted
MFCS
2007
Springer
15 years 6 months ago
2007
Springer
A framework for analyzing the computational capabilities and the limitations of the evolutionary process of random change guided by selection was recently introduced by Valiant [V...
108
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...
ECCC
2010
15 years 13 days ago
2010
We introduce a new approach to characterizing the unobserved portion of a distribution, which provides sublinear-sample additive estimators for a class of properties that includes...