427 search results - page 22 / 86 » A Subexponential Bound for Linear Programming |
EUROCOLT
1999
Springer
15 years 4 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
146
click to vote
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
111
click to vote
IJCAI
2007
15 years 1 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
ECCC
2010
14 years 11 months ago
2010
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...
SCN
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties...