395 search results - page 21 / 79 » Positive Versions of Polynomial Time |
111
click to vote
ICMCS
2005
IEEE
15 years 9 months ago
2005
IEEE
In audio fingerprinting, an audio clip must be recognized by matching an extracted fingerprint to a database of previously computed fingerprints. The fingerprints should reduc...
120
click to vote
COCO
1995
Springer
15 years 7 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
166
click to vote
WAOA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
139
Voted
PG
2007
IEEE
15 years 10 months ago
2007
IEEE
We introduce QAS, an efficient quadratic approximation of subdivision surfaces which offers a very close appearance compared to the true subdivision surface but avoids recursion,...
126
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...