In EDS ansehen

New Spectral Algorithms for Refuting Smoothed k-SAT.

Gespeichert in:
Bibliographische Detailangaben
Titel: New Spectral Algorithms for Refuting Smoothed k-SAT.
Autoren: Guruswami, Venkatesan1 (AUTHOR) vankatg@berkeley.edu, Kothari, Pravesh K.2 (AUTHOR) praveshk@cs.smu.edu, Manohar, Peter2 (AUTHOR) pmanohar@cs.cmu.edu
Quelle: Communications of the ACM. Mar2025, Vol. 68 Issue 3, p83-91. 9p.
Schlagwörter: *ALGORITHMS, COMBINATORICS, SATISFIABILITY (Computer science), HYPERGRAPHS, CONSTRAINT satisfaction
People: KARP, R. M., FEIGE, Uriel
Abstract: This research article examines a new class of spectral algorithms for smooth k-SAT formulas. The algorithms are based on Kikuchi matrices to find refutations in the k-SAT formulas. The authors refer to previous work done in this area by R.M. Karp in 1972 and by U. Feige in 2007, the current paper includes a section on proving Feige’s conjecture. Topics include combinatorics and trace moments.
Datenbank: Business Source Index
Beschreibung
Abstract:This research article examines a new class of spectral algorithms for smooth k-SAT formulas. The algorithms are based on Kikuchi matrices to find refutations in the k-SAT formulas. The authors refer to previous work done in this area by R.M. Karp in 1972 and by U. Feige in 2007, the current paper includes a section on proving Feige’s conjecture. Topics include combinatorics and trace moments.
ISSN:00010782
DOI:10.1145/3635117