973 search results - page 172 / 195 » New Bounds on Crossing Numbers |
HPCA
2009
IEEE
14 years 9 months ago
2009
IEEE
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
ALT
1999
Springer
14 years 23 days ago
1999
Springer
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
DAC
2010
ACM
14 years 12 days ago
2010
ACM
As device size shrinks to the nanometer range, FPGAs are increasingly prone to manufacturing defects. We anticipate that the ability to tolerate multiple defects will be very impo...
ECCC
2007
13 years 8 months ago
2007
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...