Many hard examples for resolution
Journal of the ACM (JACM)
Size and connectivity of the k-core of a random graph
Discrete Mathematics
Sudden emergence of a giant k-core in a random graph
Journal of Combinatorial Theory Series B
On the satisfiability and maximum satisfiability of random 3-CNF formulas
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Analysis of random processes via And-Or tree evaluation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A sharp threshold in proof complexity
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Analysis of Edge Deletion Processes on Faulty Random Regular Graphs
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
The analysis of a list-coloring algorithm on a random graph
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A novel giant-subgraph phase-transition in sparse random k-partite graphs
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
The k-orientability thresholds for Gn, p
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On Random Ordering Constraints
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
A novel giant-subgraph phase-transition in sparse random k-partite graphs
Discrete Applied Mathematics
The rigidity transition in random graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Practical perfect hashing in nearly optimal space
Information Systems
| Hi-index | 0.00 |
We describe a technique for determining the thresholds for the appearance of cores in random structures. We use it to determine (i) the threshold for the pure literal rule to find a satisfying assignment for a random instance of r-SAT, r ≥ 3, and (ii) the threshold for the appearance of a k-core in a random r-uniform hypergraph for all r, k ≥ 2, r + k 4.