Lower Bounds on OBDD Proofs with Several Orders
From MaRDI portal
Publication:5056355
DOI10.1145/3468855zbMath1505.03127OpenAlexW3196881647WikidataQ113772839 ScholiaQ113772839MaRDI QIDQ5056355
Dmitry Itsykson, Dmitry Sokolov, Artur Riazanov, Alexander Knop, Samuel R. Buss
Publication date: 8 December 2022
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3468855
lower boundsproof systemproof complexityOBDDTseitin formulasmultipartity communication complexityprojection rulereordering rule
This page was built for publication: Lower Bounds on OBDD Proofs with Several Orders