A switching algorithm for the solution of quadratic Boolean equations

DOI10.1016/0020-0190(80)90049-6zbMath0461.94015OpenAlexW2033628874MaRDI QIDQ1153123

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)

Related Items (8)

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

Cites Work

• Unnamed Item
• Testing for Equality between Maximum Matching and Minimum Node Covering
• The disengagement algorithm or a new generalization of the exclusion algorithm
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• A Way to Simplify Truth Functions
• On the Complexity of Timetable and Multicommodity Flow Problems
• A Computing Procedure for Quantification Theory
• The complexity of theorem-proving procedures

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