Pages that link to "Item:Q5354392"
From MaRDI portal
The following pages link to Determining computational complexity from characteristic ‘phase transitions’ (Q5354392):
Displayed 50 items.
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- Constraint acquisition (Q511791) (← links)
- When a genetic algorithm outperforms hill-climbing (Q596132) (← links)
- On the thresholds in linear and nonlinear Boolean equations (Q614622) (← links)
- Solving constrained combinatorial optimization problems via importance sampling in the grand canonical ensemble (Q709664) (← links)
- Problem difficulty for tabu search in job-shop scheduling (Q814423) (← links)
- Fast and optimal decoding for machine translation (Q814578) (← links)
- Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability (Q814612) (← links)
- Identifying and exploiting problem structures using explanation-based constraint programming (Q857888) (← links)
- Tutorial series on brain-inspired computing. V: Statistical mechanics of communication and computation (Q867517) (← links)
- Computational complexity of some restricted instances of 3-SAT (Q875598) (← links)
- Tensor network contractions for \#SAT (Q887094) (← links)
- Backbone analysis and algorithm design for the quadratic assignment problem (Q954381) (← links)
- Computational complexity of quantified Boolean formulas with fixed maximal deficiency (Q955019) (← links)
- Phase transitions for Gödel incompleteness (Q1006619) (← links)
- Linear CNF formulas and satisfiability (Q1028433) (← 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)
- Phase transitions and complexity in computer science: An overview of the statistical physics approach to the random satisfiability problem (Q1596668) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← 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)
- An information-based neural approach to generic constraint satisfaction. (Q1852859) (← links)
- A sharp threshold in proof complexity yields lower bounds for satisfiability search (Q1887710) (← links)
- Group planning with time constraints (Q2248560) (← links)
- On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584) (← links)
- Many hard examples in exact phase transitions (Q2368999) (← links)
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
- Sensor networks and distributed CSP: communication, computation and complexity (Q2457701) (← links)
- Pairs of SAT-assignments in random Boolean formulæ (Q2481970) (← links)
- Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem (Q2482999) (← links)
- The cavity method for the rigidity transition (Q2487799) (← links)
- Phase transitions and symmetry breaking in genetic algorithms with crossover (Q2503278) (← links)
- On the complexity of unfrozen problems (Q2581544) (← links)
- A sharp threshold for the renameable-Horn and the \(q\)-Horn properties (Q2581546) (← links)
- SAT distributions with planted assignments and phase transitions between decision and optimization problems (Q2581547) (← links)
- Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
- The state of SAT (Q2643296) (← links)
- Regular-SAT: A many-valued approach to solving combinatorial problems (Q2643307) (← links)
- An Information-Based Neural Approach to Constraint Satisfaction (Q2746341) (← links)
- Phase transition and finite-size scaling for the integer partitioning problem (Q2772921) (← links)
- Canonical failure modes of real-time control systems: insights from cognitive theory (Q2798456) (← links)
- Satisfiability by Maxwell-Boltzmann and Bose-Einstein Statistical Distributions (Q2828180) (← links)
- On the concentration of the number of solutions of random satisfiability formulas (Q2930051) (← links)
- <i>Colloquium</i>: Quantum annealing and analog quantum computation (Q3077047) (← links)
- Satisfying constraint sets through convex envelopes (Q3429327) (← links)
- SAT Distributions with Phase Transitions between Decision and Optimization Problems (Q3439111) (← links)
- An efficient local search method for random 3-satisfiability (Q3439117) (← links)
- Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire (Q3534211) (← links)
- Counting over non-planar graphs (Q5951424) (← links)
- Statistical mechanics methods and phase transitions in optimization problems (Q5958800) (← links)