2150 search results - page 66 / 430 » On a restricted cross-intersection problem |
117
click to vote
WAOA
2004
Springer
15 years 9 months ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
145
click to vote
CORR
2012
Springer
14 years 4 days ago
2012
Springer
The problem of searching a polygonal region for an unpredictably moving intruder by a set of stationary guards, each carrying an orientable laser, is known as the Searchlight Sche...
118
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
156
click to vote
STOC
2012
ACM
13 years 6 months ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
129
click to vote
STOC
2010
ACM
16 years 1 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...