Pages that link to "Item:Q1028433"
From MaRDI portal
The following pages link to Linear CNF formulas and satisfiability (Q1028433):
Displaying 15 items.
- A linear-time transformation of linear inequalities into conjunctive normal form (Q293409) (← links)
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- A general method for forbidden induced subgraph sandwich problem NP-completeness (Q2132372) (← links)
- Linear templates of ACTL formulas with an application to SAT-based verification (Q2398494) (← links)
- Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms (Q2424882) (← links)
- XSAT and NAE-SAT of linear CNF classes (Q2440094) (← links)
- Satisfiability of acyclic and almost acyclic CNF formulas (Q2908839) (← links)
- Unsatisfiable Linear CNF Formulas Are Large and Complex. (Q3113785) (← links)
- (Q3181641) (← links)
- Improved MaxSAT Algorithms for Instances of Degree 3 (Q3467831) (← links)
- On Some SAT-Variants over Linear Formulas (Q3599093) (← links)
- On Some Aspects of Mixed Horn Formulas (Q3637161) (← links)
- The Lovász Local Lemma and Satisfiability (Q3644712) (← links)
- (Q4853315) (← links)
- A CNF Formula Hierarchy over the Hypercube (Q5385533) (← links)