Pages that link to "Item:Q1770407"
From MaRDI portal
The following pages link to New algorithms for exact satisfiability (Q1770407):
Displaying 12 items.
- New plain-exponential time classes for graph homomorphism (Q639844) (← 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)
- Improved algorithms for the general exact satisfiability problem (Q2232607) (← links)
- Partition into triangles on bounded degree graphs (Q2392247) (← links)
- XSAT and NAE-SAT of linear CNF classes (Q2440094) (← links)
- On variable-weighted exact satisfiability problems (Q2462633) (← 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)
- Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems (Q5855059) (← links)
