Computational Geometry · 1996 · 29 citations · 13 references
ComputingComputer ScienceMathematicsComputational GeometryTheory Of ComputationTopologyComputational ComplexityComputational TopologyGeometry ProcessingGraph AlgorithmsGraph TheoryCombinatorial TopologyFace EnumerationSimplicial Complexes
13
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.2K citations · Full text
Algebraic Topology: An Introduction.
Barry Mitchell, William S. Massey · American Mathematical Monthly · 1968 · 1.2K citations
Efficient probabilistically checkable proofs and applications to approximations
Mihir Bellare, S. Goldwasser, Carsten Lund et al. · 1993 · 318 citations
On the hardness of approximating minimization problems
Carsten Lund, Mihalis Yannakakis · 1993 · 217 citations · Full text