scientific article
From MaRDI portal
Publication:3181650
zbMATH Open1187.68526MaRDI QIDQ3181650
Alexander Wolfgang Karl Kurt Hertel, Alasdair Urquhart
Publication date: 12 October 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Unnamed Item ⋮ Proofs and Certificates for Max-SAT ⋮ A Logical Autobiography ⋮ A proof builder for Max-SAT
Recommendations
- Unnamed Item 👍 👎
- An algorithmic approach to resolutions 👍 👎
- On unit read-once resolutions and copy complexity 👍 👎
- The Efficiency of Resolution and Davis--Putnam Procedures 👍 👎
- Complexity results on DPLL and resolution 👍 👎
- Integer complexity: algorithms and computational results 👍 👎
- Complexity of computation of embedded resolution of algebraic curves 👍 👎
- The complexity of resolution refinements 👍 👎
This page was built for publication:
