Tractable and intractable classes of propositional schemata

DOI10.1093/LOGCOM/EXU013zbMATH Open1344.03010OpenAlexW2162803372MaRDI QIDQ5498869

Nicolas Peltier

Publication date: 11 February 2015

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exu013

zbMATH Keywords

complexitypropositional logicsatisfiability problembounded quantifiersiterated schemata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Classical propositional logic (03B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Tractable and intractable classes of propositional schemata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5498869)