1383 search results - page 198 / 277 » On the Complexity of the Interlace Polynomial |
152
click to vote
CP
2005
Springer
15 years 12 months ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
185
click to vote
ESA
2005
Springer
15 years 12 months ago
2005
Springer
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
146
click to vote
SSD
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Many new applications involving moving objects require the collection and querying of trajectory data, so efficient indexing methods are needed to support complex spatio...
158
click to vote
ACSAC
2003
IEEE
15 years 11 months ago
2003
IEEE
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
141
click to vote
CRYPTO
2003
Springer
15 years 11 months ago
2003
Springer
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...