5372 search results - page 469 / 1075 » complexity 2007 |
183
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
177
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
For more than 35 years, the fastest known method for integer multiplication has been the Sch?onhage-Strassen algorithm running in time O(n log n log log n). Under certain restricti...
203
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
264
click to vote
VLDB
2007
ACM
16 years 7 months ago
2007
ACM
Life science laboratories today have to rely on procedural techniques to store and manage large sequence datasets. Procedural techniques are cumbersome to use and are often very i...
245
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
We demonstrate a novel query interface that enables users to construct a rich search query without any prior knowledge of the underlying schema or data. The interface, which is in...