6568 search results - page 213 / 1314 » Reducing the Complexity of Reductions |
153
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy co...
185
click to vote
SAS
1999
Springer
15 years 11 months ago
1999
Springer
The intrinsic complexity of most protocol speci cations in particular, and of asynchronous systems in general, lead us to study combinations of static analysis with classical model...
159
click to vote
APPINF
2003
15 years 8 months ago
2003
This paper presents an algorithm for recursive data processing in directed graphs. The proposed algorithm applies graph reduction in order to determine both starting points and a ...
146
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
As text corpora become larger, tradeoffs between speed and accuracy become critical: slow but accurate methods may not complete in a practical amount of time. In order to make the...
166
click to vote
SIGSOFT
2007
ACM
16 years 7 months ago
2007
ACM
There has recently been a great deal of interest in search? based test data generation, with many local and global search algorithms being proposed. However, to date, there has be...