Pages that link to "Item:Q3101335"
From MaRDI portal
The following pages link to Critical Behavior in the Satisfiability of Random Boolean Expressions (Q3101335):
Displaying 50 items.
- Asymptotic and finite size parameters for phase transitions: Hamiltonian circuit as a case study (Q293254) (← links)
- Random subcube intersection graphs. I: Cliques and covering (Q311574) (← links)
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
- Local search for Boolean satisfiability with configuration checking and subscore (Q490437) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances (Q596103) (← links)
- Combinatorial sharpness criterion and phase transition classification for random CSPs (Q598196) (← links)
- On the thresholds in linear and nonlinear Boolean equations (Q614622) (← links)
- Phase transition and finite-size scaling in the vertex-cover problem (Q709759) (← links)
- Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT (Q764375) (← links)
- Tutorial series on brain-inspired computing. V: Statistical mechanics of communication and computation (Q867517) (← links)
- Computational complexity of the landscape. I. (Q877685) (← links)
- String matching and 1d lattice gases (Q878347) (← links)
- Tensor network contractions for \#SAT (Q887094) (← links)
- The asymptotic \(k\)-SAT threshold (Q900872) (← links)
- Modelling the dynamics of stochastic local search on \(k\)-SAT (Q930153) (← links)
- Random subcubes as a toy model for constraint satisfaction problems (Q937116) (← links)
- Coreduction homology algorithm (Q1006400) (← links)
- The TSP phase transition (Q1391912) (← links)
- Generalized satisfiability problems: Minimal elements and phase transitions. (Q1401338) (← links)
- (2+\(f\)(\(n\)))-SAT and its properties. (Q1421480) (← links)
- On the average similarity degree between solutions of random \(k\)-SAT and random CSPs. (Q1421490) (← links)
- Complexity-theoretic models of phase transitions in search problems (Q1583531) (← links)
- A framework for structured quantum search. (Q1586960) (← links)
- PhysComp96. Proceedings of the 4th workshop on physics and computation, Boston, MA, USA, November 22--24, 1996 (Q1587487) (← links)
- Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT (Q1777400) (← links)
- A sharp threshold in proof complexity yields lower bounds for satisfiability search (Q1887710) (← links)
- Threshold behaviors of a random constraint satisfaction problem with exact phase transitions (Q1944183) (← links)
- The satisfiability threshold for random linear equations (Q2003764) (← links)
- On the satisfiability threshold of formulas with three literals per clause (Q2271431) (← links)
- Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas (Q2362359) (← links)
- Resolving Braess's paradox in random networks (Q2408090) (← links)
- Pairs of SAT-assignments in random Boolean formulæ (Q2481970) (← links)
- SAT distributions with planted assignments and phase transitions between decision and optimization problems (Q2581547) (← links)
- Phase transitions and the search problem (Q2674173) (← links)
- Generating hard satisfiability problems (Q2674174) (← links)
- Experimental results on the crossover point in random 3-SAT (Q2674177) (← links)
- An empirical study of phase transitions in binary constraint satisfaction problems (Q2674179) (← links)
- Locating the phase transition in binary constraint satisfaction problems (Q2674182) (← links)
- Hard random 3-SAT problems and the Davis-Putnam procedure (Q2674184) (← links)
- Implicates and prime implicates in random 3-SAT (Q2674186) (← links)
- Critical behavior in the computational cost of satisfiability testing (Q2674189) (← links)
- Problem structure heuristics and scaling behavior for genetic algorithms (Q2674193) (← links)
- The scaling window of the 2-SAT transition (Q2725029) (← links)
- Delaying satisfiability for random 2SAT (Q2852549) (← links)
- PHASE TRANSITIONS OF EXPSPACE-COMPLETE PROBLEMS: A FURTHER STEP (Q2909190) (← links)
- On the concentration of the number of solutions of random satisfiability formulas (Q2930051) (← links)
- Error catastrophe for viruses infecting cells: analysis of the phase transition in terms of error classes (Q2997265) (← links)
- Random matrix model of adiabatic quantum computing (Q3102395) (← links)
- On the quantum spin glass transition on the Bethe lattice (Q3302837) (← links)
