Geodesic

Computational complexity theory. Part X

A new upper bound for $(n,3)$-MAX-SAT
p. 5-14
Optimal heuristic algorithms for the image of an injective function
p. 15-31
Feebly secure cryptographic primitives
p. 32-64
Circuit complexity of linear functions: gate elimination and feeble security
p. 65-87
The complexity of inversion of explicit Goldreich's function by DPLL algorithms
p. 88-108
Diophantine hierarchy
p. 109-127