A switching algorithm for the solution of quadratic boolean equations
- 12 December 1980
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 11 (4-5), 193-198
- https://doi.org/10.1016/0020-0190(80)90049-6
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A linear-time algorithm for testing the truth of certain quantified boolean formulasInformation Processing Letters, 1979
- Testing for equality between maximum matching and minimum node coveringInformation Processing Letters, 1977
- The disengagement algorithm or a new generalization of the exclusion algorithmDiscrete Mathematics, 1977
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960
- A Way to Simplify Truth FunctionsThe American Mathematical Monthly, 1955