Pages that link to "Item:Q2674177"
From MaRDI portal
The following pages link to Experimental results on the crossover point in random 3-SAT (Q2674177):
Displaying 28 items.
- Planning as satisfiability: heuristics (Q359984) (← links)
- Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT (Q764375) (← links)
- On market-inspired approaches to propositional satisfiability (Q814434) (← links)
- On threshold properties of \(k\)-SAT: An additive viewpoint (Q852710) (← links)
- The TSP phase transition (Q1391912) (← links)
- How to fake an RSA signature by encoding modular root finding as a SAT problem (Q1408375) (← links)
- On the limit of branching rules for hard random unsatisfiable 3-SAT (Q1408384) (← links)
- SAT problems with chains of dependent variables (Q1408386) (← links)
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. (Q1426130) (← links)
- Backtracking algorithms for disjunctions of temporal constraints (Q1575430) (← links)
- Extending and implementing the stable model semantics (Q1603743) (← links)
- Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
- A novel algorithm for Max Sat calling MOCE to order (Q2149880) (← links)
- New models for generating hard random Boolean formulas and disjunctive logic programs (Q2287195) (← links)
- Variations and extension of the convex-concave procedure (Q2358020) (← links)
- Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas (Q2362359) (← links)
- Modelling and solving temporal reasoning as propositional satisfiability (Q2389682) (← links)
- The resolution complexity of random graph \(k\)-colorability (Q2581545) (← links)
- Implicates and prime implicates in random 3-SAT (Q2674186) (← links)
- CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
- Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
- An efficient local search method for random 3-satisfiability (Q3439117) (← links)
- A general system for heuristic minimization of convex functions over non-convex sets (Q4638917) (← links)
- A sharp threshold for the phase transition of a restricted satisfiability problem for Horn clauses (Q5931554) (← links)
- On the complexity of \(k\)-SAT (Q5943094) (← links)
- Upper bounds on the satisfiability threshold (Q5958807) (← links)
- Frozen development in graph coloring (Q5958809) (← links)
- Generating Difficult CNF Instances in Unexplored Constrainedness Regions (Q6039929) (← links)
