364 search results - page 3 / 73 » Dimension Characterizations of Complexity Classes |
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...
IFIP
2004
Springer
13 years 10 months 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 ...
IJFCS
2000
13 years 5 months ago
2000
DCG
2010
13 years 5 months ago
2010
The angle defect, which is the standard way to measure the curvatures at the vertices of polyhedral surfaces, goes back at least as far as Descartes. Although the angle defect has ...
ECML
1993
Springer
13 years 9 months ago
1993
Springer
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...