A switching algorithm for the solution of quadratic Boolean equations

DOI10.1016/0020-0190(80)90049-6MaRDI QIDQ1153123zbMATH OpenOpenAlexFDO

Authors Rossella Petreschi, Bruno Simeone

Publication date 1980

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(80)90049-6

zbMATH Keywords

algorithms on graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Cites work

• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• A Computing Procedure for Quantification Theory
• A Way to Simplify Truth Functions
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• On the Complexity of Timetable and Multicommodity Flow Problems
• Testing for Equality between Maximum Matching and Minimum Node Covering
• The complexity of theorem-proving procedures
• The disengagement algorithm or a new generalization of the exclusion algorithm

Cited in

(8)

• A pseudo-Boolean consensus approach to nonlinear 0-1 optimization
• Uniquely solvable quadratic Boolean equations
• On quadratic Boolean equations
• On-line 2-satisfiability
• Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems
• Minimum-delay schedules in layered networks
• LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
• 2-satisfiability and diagnosing fault processors in massively parallel computing systems

This page was built for publication: A switching algorithm for the solution of quadratic Boolean equations

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