1379 search results - page 195 / 276 » The Complexity of the Annihilating Polynomial |
149
click to vote
ER
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs:...
176
click to vote
FOCS
2006
IEEE
16 years 13 days ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
158
click to vote
INFOCOM
2006
IEEE
16 years 12 days ago
2006
IEEE
— We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically fail to detect attacks and also gener...
104
click to vote
IPPS
2006
IEEE
16 years 12 days ago
2006
IEEE
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...
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...