1022 search results - page 6 / 205 » Logspace Complexity of Functions and Structures |
AMC
2008
13 years 7 months ago
2008
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
FCT
2009
Springer
14 years 2 months 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...
EUROCOLT
1995
Springer
13 years 11 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
BIOSYSTEMS
2007
13 years 7 months ago
2007
The structural organization of biological systems is one of nature’s most fascinating aspects, but its origin and functional role is not yet fully understood. For instance, basi...
FSTTCS
1992
Springer
13 years 11 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...