Journal of Computer and System Sciences · 1995 · 61 citations · 12 references
ComputingComputer ScienceMathematicsAlgorithmsOptimizationTheory Of ComputationApproximation AlgorithmsCombinatorial OptimizationComputational ComplexityComputational Complexity ClassesDiscrete OptimizationOptimization TheoryApproximation ComplexityApproximation HardnessApproximation PropertiesDefinabilityMinimizationNp-hardnessSet Cover ApproximationSet Cover Problem
12
Proof verification and hardness of approximation problems
Sanjeev Arora, Carsten Lund, R. Motwani et al. · 1992 · 744 citations
Relational queries computable in polynomial time
Neil Immerman · Information and Control · 1986 · 648 citations