468 search results - page 16 / 94 » One-Way Functions in Complexity Theory |
JC
2006
14 years 11 months ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
ALT
2004
Springer
15 years 8 months ago
2004
Springer
Rademacher and Gaussian complexities are successfully used in learning theory for measuring the capacity of the class of functions to be learned. One of the most important propert...
133
click to vote
CSL
2007
Springer
15 years 5 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ļ...
COCO
2009
Springer
15 years 5 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of GĀ“acs shows that the analog of the coding theorem fails for continuous sample...
EUROCOLT
1995
Springer
15 years 2 months ago
1995
Springer
Limiting identiļ¬cation of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identiļ¬cation of programs for computable functions (fr...