5244 search results - page 375 / 1049 » Structural Complexity of AvgBPP |
192
click to vote
ICALP
2003
Springer
16 years 1 days ago
2003
Springer
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
151
click to vote
DGCI
2000
Springer
15 years 11 months ago
2000
Springer
The paper presents a new method of investigating topological properties of three-dimensional manifolds by means of computers. Manifolds are represented as finite cell complexes. Th...
357
click to vote
DIMACS
1996
15 years 8 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
172
click to vote
IM
2008
15 years 6 months ago
2008
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...
224
click to vote
PPDP
2010
Springer
15 years 5 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...