1511 search results - page 114 / 303 » Randomness, lowness and degrees |
152
click to vote
ISSAC
2005
Springer
15 years 11 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
182
click to vote
WDAG
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
158
click to vote
COCO
2001
Springer
15 years 10 months ago
2001
Springer
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
177
click to vote
COMPLEX
2009
Springer
15 years 10 months ago
2009
Springer
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
172
click to vote
NIPS
2004
15 years 7 months ago
2004
We introduce a computationally efficient method to estimate the validity of the BP method as a function of graph topology, the connectivity strength, frustration and network size....