scientific article; zbMATH DE number 1943080

zbMATH Open1029.06009MaRDI QIDQ4409643FDOQ4409643

G. P. Tonoyan

Publication date: 30 June 2003

Title of this publication is not available (Why is that?)

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)

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of finding the number of solutions of systems of Boolean equations

   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 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)