514 search results - page 1 / 103 » On the Structure of Valiant's Complexity Classes |
STACS
1998
Springer
13 years 9 months ago
1998
Springer
JC
2008
13 years 5 months ago
2008
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
COCO
2007
Springer
13 years 11 months ago
2007
Springer
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
FCT
2009
Springer
14 years 3 days ago
2009
Springer
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...
IJCAI
1989
13 years 6 months ago
1989
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...