29 search results - page 5 / 6 » Lower bounds for linear degeneracy testing |
COCO
2005
Springer
13 years 11 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
CPAIOR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
APPROX
2011
Springer
12 years 5 months ago
2011
Springer
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
COCO
2009
Springer
14 years 14 hour ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
PKDD
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...