Efficient descriptor-vector multiplications in stochastic automata networks
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Proof verification and the hardness of approximation problems
Beyond the flow decomposition barrier
Probabilistic checking of proofs: a new characterization of NP
Property testing and its connection to learning and approximation