Pages that link to "Item:Q596105"
From MaRDI portal
The following pages link to Algorithms for four variants of the exact satisfiability problem (Q596105):
Displaying 17 items.
- Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) (← links)
- Sort and Search: exact algorithms for generalized domination (Q989487) (← 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)
- Counting models for 2SAT and 3SAT formulae (Q1770390) (← links)
- New algorithms for exact satisfiability (Q1770407) (← 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)
- On variable-weighted exact satisfiability problems (Q2462633) (← links)
- NEW WORST-CASE UPPER BOUND FOR COUNTING EXACT SATISFIABILITY (Q2941085) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705953) (← links)
- Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems (Q5855059) (← links)
- Local search strikes again: PTAS for variants of geometric covering and packing (Q5919362) (← links)
- Exactly hittable interval graphs (Q6599815) (← links)