Pages that link to "Item:Q1087560"
From MaRDI portal
The following pages link to Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas (Q1087560):
Displaying 39 items.
- Disproof of the neighborhood conjecture with implications to SAT (Q377802) (← links)
- On Davis-Putnam reductions for minimally unsatisfiable clause-sets (Q391124) (← links)
- A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085) (← links)
- Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← links)
- Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable (Q557836) (← links)
- Irreducible disjoint covering systems (with an application to Boolean algebra) (Q805651) (← links)
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- Computational complexity of quantified Boolean formulas with fixed maximal deficiency (Q955019) (← links)
- An upper bound for the circuit complexity of existentially quantified Boolean formulas (Q982657) (← links)
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (Q1037642) (← links)
- An infinite version of Ryser's inequality (Q1087875) (← links)
- On the structure of some classes of minimal unsatisfiable formulas (Q1408380) (← links)
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381) (← links)
- Homomorphisms of conjunctive normal forms. (Q1408387) (← links)
- Finding read-once resolution refutations in systems of 2CNF clauses (Q1749535) (← links)
- A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685) (← links)
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
- The complexity of homomorphisms and renamings for minimal unsatisfiable formulas (Q1777396) (← links)
- Generalizations of matched CNF formulas (Q1777405) (← links)
- Extension and equivalence problems for clause minimal formulae (Q1777408) (← links)
- On subclasses of minimal unsatisfiable formulas (Q1841884) (← links)
- Investigations on autark assignments (Q1841885) (← links)
- Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. (Q1853126) (← links)
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541) (← links)
- Space bounds for resolution (Q1854472) (← links)
- A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
- Minimal non-odd-transversal hypergraphs and minimal non-odd-bipartite hypergraphs (Q2213812) (← links)
- 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000 (Q2732529) (← links)
- On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas (Q2988835) (← links)
- On Variables with Few Occurrences in Conjunctive Normal Forms (Q3007672) (← links)
- On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution (Q3012839) (← links)
- A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application (Q3088277) (← links)
- The Lovász Local Lemma and Satisfiability (Q3644712) (← links)
- Sharp thresholds of graph properties, and the $k$-sat problem (Q4257709) (← links)
- Smooth and sharp thresholds for random<i>{k}</i>-XOR-CNF satisfiability (Q4825479) (← links)
- Smooth and sharp thresholds for random<i>{k}</i>-XOR-CNF satisfiability (Q4825480) (← links)
- Finding the Hardest Formulas for Resolution (Q5154766) (← links)
- The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant (Q6158363) (← links)
- Are hitting formulas hard for resolution? (Q6162037) (← links)
