Podcast

news

For familiarization with the basic definitions and theorems, it is recommended to read the book: M. Gary, D. Johnson,
"Computers and intractable tasks."
Random_k-SAT
[VV1986] LG Valiant, VV, NP NP, as it is easy to detect unique solutions (it is shown that SAT, under randomized reduction)
[Var1982] M. Vardi, Complexity of Relational Query Languages
[Imm1986] N. Immerman, Relational Queries Computable in Polynomial Time ([Imm1982] and [Var1982] give th. Immerman-Vardi that FO (LFP) = P)
Wiki, where the basic data on the verification and paper
Apparently the first or one of the first mentions on the Internet about paper
The first comment of prof. Liption
Links to the rest are in the wiki, here's another important comment ,
where Liption publishes a letter from Immerman that Deolalikar unreasonably uses only mondaic fixed points and
indicates that he relies on this property in his proof, but indicates that then he does not receive all of P.
it turns out that Deolalikar incorrectly applies the Immermana-Vardi theorem. Error found!
Other: mentioned “brick”: T. Kormen, C. Lazerson, R. Rivest, “Algorithms: construction and analysis”