A DNF without Regular Shortest Consensus Path
From MaRDI portal
Publication:3769994
DOI10.1137/0216054zbMath0632.68085OpenAlexW1973028123MaRDI QIDQ3769994
Publication date: 1987
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0216054
Related Items (2)
Regular and General Resolution: An Improved Separation ⋮ Reflections on Proof Complexity and Counting Principles
This page was built for publication: A DNF without Regular Shortest Consensus Path