A linear time equivalence test for read-twice DNF formulas
From MaRDI portal
Publication:1334630
DOI10.1016/0020-0190(93)90171-5zbMath0942.68780OpenAlexW1977632998MaRDI QIDQ1334630
Vijay Raghavan, Krishnan Pillaipakkamnatt
Publication date: 25 September 1994
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90171-5
Cites Work
- Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
- Read-twice DNF formulas are properly learnable
- A theory of the learnable
- Algebraic Structures with Hard Equivalence and Minimization Problems
- The complexity of theorem-proving procedures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item