Pages that link to "Item:Q672138"
From MaRDI portal
The following pages link to Number of models and satisfiability of sets of clauses (Q672138):
Displaying 12 items.
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- A rigorous methodology for specification and verification of business processes (Q1037243) (← links)
- Counting models for 2SAT and 3SAT formulae (Q1770390) (← links)
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552) (← links)
- New methods for 3-SAT decision and worst-case analysis (Q1960406) (← links)
- On \(k\)-positive satisfiability problem (Q1964360) (← links)
- Faster exponential-time algorithms for approximately counting independent sets (Q2235762) (← links)
- New upper bound for the \#3-SAT problem (Q2380029) (← links)
- Counting for satisfiability by inverting resolution (Q2386352) (← links)
- Exploiting independent subformulas: a faster approximation scheme for \(\# k\)-SAT (Q2450932) (← links)
- A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances (Q3503590) (← links)
- Explaining by evidence (Q4779486) (← links)
