Unit refutability of Horn constraint systems -- certification and parallel complexity

DOI10.1016/J.TCS.2025.115419MaRDI QIDQ6930241zbMATH OpenFDO

Authors Piotr Wojciechowski, K. Subramani

Publication date 16 September 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Complexity of proofs (03F20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

This page was built for publication: Unit refutability of Horn constraint systems -- certification and parallel complexity

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