1379 search results - page 176 / 276 » The Complexity of the Annihilating Polynomial |
156
click to vote
ASIAN
2003
Springer
15 years 11 months ago
2003
Springer
Predicate detection is an important problem in distributed systems. Based on the temporal interactions of intervals, there exists a rich class of modalities under which global pred...
149
click to vote
TAMC
2010
Springer
15 years 11 months ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
138
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
Upon completion of the human and mouse genome sequences, world-wide sequencing capacity will turn to other complex organisms. Current strategies call for many of these genomes to ...
168
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
150
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...