Pages that link to "Item:Q1770407"
From MaRDI portal
The following pages link to New algorithms for exact satisfiability (Q1770407):
Displaying 25 items.
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- New plain-exponential time classes for graph homomorphism (Q639844) (← links)
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability (Q937398) (← links)
- Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) (← links)
- An algorithm for exact satisfiability analysed with the number of clauses as parameter (Q1045885) (← links)
- Exact satisfiability, a natural extension of set partition, and its average case behavior (Q1353993) (← links)
- Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\) (Q1777401) (← links)
- Faster exact solutions for some NP-hard problems. (Q1853491) (← links)
- Improved algorithms for the general exact satisfiability problem (Q2232607) (← links)
- Partition into triangles on bounded degree graphs (Q2392247) (← links)
- Metalevel algorithms for variant satisfiability (Q2413027) (← links)
- XSAT and NAE-SAT of linear CNF classes (Q2440094) (← links)
- On variable-weighted exact satisfiability problems (Q2462633) (← links)
- An upper bound \(O(2^{0.16254n})\) for exact 3-satisfiability: a simpler proof (Q2577590) (← links)
- NEW WORST-CASE UPPER BOUND FOR COUNTING EXACT SATISFIABILITY (Q2941085) (← links)
- Partition into Triangles on Bounded Degree Graphs (Q3075543) (← links)
- New Plain-Exponential Time Classes for Graph Homomorphism (Q3392969) (← links)
- On Some SAT-Variants over Linear Formulas (Q3599093) (← links)
- (Q3634956) (← links)
- Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width (Q4914311) (← links)
- 一类可分离SAT问题的O(1.890 n )精确算法 (Q5381999) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705953) (← links)
- STACS 2005 (Q5710689) (← links)
- Theory and Applications of Satisfiability Testing (Q5713721) (← links)
- Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems (Q5855059) (← links)
