Geodesic

Computational complexity theory. Part VII

Systems of pair of $q$-distant representatives and graph colorings
p. 5-25
Public-key cryptography and invariant theory
p. 26-38
On non-abelian homomorphic public-key cryptosystems
p. 39-58
Blocks in $k$-connected graphs
p. 59-93
Solution lifting method for handling Meta-variables in the TH$\exists$OREM$\forall$ system
p. 94-117
An upper bound $O(2^{0.16254n})$ for Exact 3-Satisfiability: a simpler proof
p. 118-128
A $2^{|E|/4}$-time Algorithm for MAX-CUT
p. 129-138
Hard satisfiable formulas for DPLL-type algorithms
p. 139-148
Intertible infinitary calculus without loop rules for a restricted FTL
p. 149-180