245 search results - page 17 / 49 » Locating phase transitions in computationally hard problems |
ECCC
1998
13 years 7 months ago
1998
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
JAIR
2007
13 years 7 months ago
2007
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
DAC
1995
ACM
13 years 11 months ago
1995
ACM
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
SAC
2011
ACM
12 years 10 months ago
2011
ACM
A moving region whose location and extend change over time can imply topological changes such as region split and hole formation. To study this phenomenon is useful in many applic...
SC
2009
ACM
14 years 2 months ago
2009
ACM
The scalability of future massively parallel processing (MPP) systems is being severely challenged by high failure rates. Current hard disk drive (HDD) checkpointing results in ov...