514 search results - page 3 / 103 » On the Structure of Valiant's Complexity Classes |
CAISE
2003
Springer
14 years 20 days ago
2003
Springer
In software engineering it is widely acknowledged that the usage of metrics at the initial phases of the object oriented software life cycle can help designers to make better decis...
COCO
2004
Springer
14 years 25 days ago
2004
Springer
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
IFIP
2004
Springer
14 years 25 days ago
2004
Springer
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
COCO
1994
Springer
13 years 11 months ago
1994
Springer
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Statistical query (SQ) learning model of Kearns is a natural restriction of the PAC learning model in which a learning algorithm is allowed to obtain estimates of statistical prop...