264 search results - page 34 / 53 » On the possibility of faster SAT algorithms |
101
click to vote
SIGMOD
2004
ACM
15 years 10 months ago
2004
ACM
Microarray datasets typically contain large number of columns but small number of rows. Association rules have been proved to be useful in analyzing such datasets. However, most e...
ISSAC
2009
Springer
15 years 4 months ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
ASPDAC
2004
ACM
15 years 3 months ago
2004
ACM
As gate delays decrease faster than wire delays for each technology generation, buffer insertion becomes a popular method to reduce the interconnect delay. Several modern buffer in...
108
click to vote
STOC
2006
ACM
15 years 10 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
89
Voted
CAV
2006
Springer
15 years 1 months ago
2006
Springer
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...