The phase transition in 1-in-k SAT and NAE 3-SAT
SODA '01 Proceedings of the twelfth 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
Statistical mechanics methods and phase transitions in optimizationproblems
Theoretical Computer Science - Phase transitions in combinatorial problems
On Semidefinite Programming Relaxations of (2+p)-SAT
Annals of Mathematics and Artificial Intelligence
Evolutionary local-search with extremal optimization
Neural, Parallel & Scientific Computations
On the critical exponents of random k-SAT
Random Structures & Algorithms
The phase transition in random horn satisfiability and its algorithmic implications
Random Structures & Algorithms
Spin-flip symmetry and synchronization
Evolutionary Computation
The interface between P and NP: COL, XOR, NAE, 1-in-k, and Horn SAT
Eighteenth national conference on Artificial intelligence
A sharp threshold in proof complexity yields lower bounds for satisfiability search
Journal of Computer and System Sciences - STOC 2001
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances
Theoretical Computer Science
Annals of Mathematics and Artificial Intelligence
Recognizing frozen variables in constraint satisfaction problems
Theoretical Computer Science
Annals of Mathematics and Artificial Intelligence
The probabilistic analysis of a greedy satisfiability algorithm
Random Structures & Algorithms
On threshold properties of k-SAT: an additive viewpoint
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
A continuous–discontinuous second-order transition in the satisfiability of random Horn-SAT formulas
Random Structures & Algorithms
Computational complexity of auditing finite attributes in statistical databases
Journal of Computer and System Sciences
Backbone fragility and the local search cost peak
Journal of Artificial Intelligence Research
Distributed reasoning in a peer-to-peer setting: application to the semantic web
Journal of Artificial Intelligence Research
Scalability study of peer-to-peer consequence finding
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
On the possibility of faster SAT algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Generating highly balanced sudoku problems as hard problems
Journal of Heuristics
A continuous-discontinuous second-order transition in the satisfiability of random Horn-SAT formulas
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
Theoretical Computer Science
A physics-style approach to scalability of distributed systems
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
A framework for the specification of random SAT and QSAT formulas
TAP'12 Proceedings of the 6th international conference on Tests and Proofs
Techniques for SAT-based constrained test pattern generation
Microprocessors & Microsystems
| Hi-index | 0.00 |