scientific article; zbMATH DE number 1943080

MaRDI QIDQ4409643zbMATH OpenFDO

Authors G. P. Tonoyan

Publication date 30 June 2003

zbMATH Keywords

NP-completesatisfiability problemsatisfiability of systems of Boolean equations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Boolean functions (06E30)

Recommendations

• On the complexity of the satisfiability problem for a system of functional Boolean equations
• On the complexity of finding the number of solutions of systems of Boolean equations
• On complexity of problem of satisfiability for systems of countable-valued functional equations
• Publication:4727432
• scientific article; zbMATH DE number 4039349

Cited in

(6)

• scientific article; zbMATH DE number 1196693 (Why is no real title available?)
• On the complexity of finding the number of solutions of systems of Boolean equations
• On the complexity of the satisfiability problem for a system of functional Boolean equations
• On complexity of problem of satisfiability for systems of countable-valued functional equations
• scientific article; zbMATH DE number 3849128 (Why is no real title available?)
• scientific article; zbMATH DE number 4001486 (Why is no real title available?)

This page was built for publication:

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