An algorithm for the class of pure implicational formulas
From MaRDI portal
Publication:1961448
DOI10.1016/S0166-218X(99)00038-4zbMath0941.68154OpenAlexW2037072284MaRDI QIDQ1961448
Ewald Speckenmeyer, R. P. Swaminathan, Judy Goldsmith, John S. Schlipf, John V. Franco
Publication date: 17 January 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00038-4
Related Items (3)
Improving a fixed parameter tractability time bound for the shadow problem ⋮ On generalizations of the shadow independent set problem ⋮ Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
Uses Software
This page was built for publication: An algorithm for the class of pure implicational formulas
