An approximately fast algorithm for deciding the validity of disjunctive normal forms (DNFs)

zbMATH Open0772.68055MaRDI QIDQ1801736FDOQ1801736

Authors: Enmin Song, Wenqi Huang 

Publication date: 1992

Published in: Chinese Science Bulletin (Search for Journal in Brave)

Recommendations

• On deterministic approximation of DNF
• scientific article; zbMATH DE number 4092808
• scientific article; zbMATH DE number 169259
• An algorithm for the satisfiability problem of formulas in conjunctive normal form
• On the learnability of disjunctive normal form formulas

zbMATH Keywords

NP-complete problemdisjunctive normal form validity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (4)

• Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). II
• Title not available (Why is that?)
• A DNF without Regular Shortest Consensus Path
• Title not available (Why is that?)

This page was built for publication: An approximately fast algorithm for deciding the validity of disjunctive normal forms (DNFs)

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