论文信息 - A Switching Algorithm for the Solution of Quadratic Boolean Equations - 字舞流文

A Switching Algorithm for the Solution of Quadratic Boolean Equations

Rossella Petreschi | Bruno Simeone

[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[2] Fanica Gavril,et al. Testing for Equality Between Maximum Matching and Minimum Node Covering , 1977, Inf. Process. Lett..

[3] E. Pichat. The disengagement algorithm or a new generalization of the exclusion algorithm , 1977, Discret. Math..

[4] Alon Itai,et al. On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[5] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.

[6] Robert E. Tarjan,et al. A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[7] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .