7106 search results - page 242 / 1422 » Restricted Complexity, General Complexity |
163
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
149
click to vote
PODS
2010
ACM
15 years 9 months ago
2010
ACM
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
118
click to vote
RTSS
2002
IEEE
15 years 9 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
159
click to vote
KR
2010
Springer
15 years 9 months ago
2010
Springer
In constraint or preference reasoning, a typical task is to compute a solution, or an optimal solution. However, when one has already a solution, it may be important to produce th...
126
click to vote
ICICS
2001
Springer
15 years 8 months ago
2001
Springer
With the ubiquitous deployment of large scale networks more and more complex human interactions are supported by computer applications. This poses new challenges on the expressive...