A DNF without Regular Shortest Consensus Path

DOI10.1137/0216054MaRDI QIDQ3769994zbMATH OpenOpenAlexFDO

Authors Wenqi Huang, Xiang Dong Yu

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

zbMATH Keywords

consensusdisjunctive normal formresolution

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Boolean functions (06E30)

Recommendations

• scientific article; zbMATH DE number 2208610
• scientific article; zbMATH DE number 3887605
• The DNF exception problem
• scientific article; zbMATH DE number 169259
• An approximately fast algorithm for deciding the validity of disjunctive normal forms (DNFs)

Cited in

(3)

• Regular and General Resolution: An Improved Separation
• Reflections on Proof Complexity and Counting Principles
• scientific article; zbMATH DE number 3378825 (Why is no real title available?)

This page was built for publication: A DNF without Regular Shortest Consensus Path

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