1058 search results - page 46 / 212 » It's Doomed; We Can Prove It |
LPNMR
2001
Springer
14 years 2 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
JCT
2008
13 years 10 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
EMSOFT
2003
Springer
14 years 3 months ago
2003
Springer
We introduce the paradigm of schedule-carrying code (SCC). A hard real-time program can be executed on a given platform only if there exists a feasible schedule for the real-time t...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
CPAIOR
2007
Springer
14 years 4 months ago
2007
Springer
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...