Pages that link to "Item:Q3101335"

The following pages link to Critical Behavior in the Satisfiability of Random Boolean Expressions (Q3101335):

Displayed 36 items.

• 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)
• 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)
• 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)
• On the satisfiability threshold of formulas with three literals per clause (Q2271431) ‎ (← 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)
• The scaling window of the 2-SAT transition (Q2725029) ‎ (← links)
• SAT Distributions with Phase Transitions between Decision and Optimization Problems (Q3439111) ‎ (← links)
• An efficient local search method for random 3-satisfiability (Q3439117) ‎ (← links)
• Physics and complexity (Q3579096) ‎ (← links)
• On the survey-propagation equations in random constraint satisfiability problems (Q3624676) ‎ (← links)
• Sharp thresholds of graph properties, and the $k$-sat problem (Q4257709) ‎ (← links)
• Secure information hiding based on computationally intractable problems (Q4440673) ‎ (← links)
• Entropy of the<i>K</i>-Satisfiability Problem (Q4492386) ‎ (← links)
• The phase transition in random horn satisfiability and its algorithmic implications (Q4543632) ‎ (← links)
• (Q4704799) ‎ (← links)
• GD-SAT model and crossover line (Q4784347) ‎ (← links)
• A user authentication protocol based on the intractability of the 3-coloring problem (Q4792932) ‎ (← links)
• Smooth and sharp thresholds for random<i>{k}</i>-XOR-CNF satisfiability (Q4825479) ‎ (← links)
• Smooth and sharp thresholds for random<i>{k}</i>-XOR-CNF satisfiability (Q4825480) ‎ (← links)
• Quantum optimization (Q5946294) ‎ (← links)
• Statistical mechanics methods and phase transitions in optimization problems (Q5958800) ‎ (← links)