Author:
Chen WenBin,Yin Dengpan,Chen Zhengzhang
Subject
General Computer Science,Theoretical Computer Science
Reference23 articles.
1. The complexity and approximability of finding feasible subsystems of linear relations;Amaldi;Theoretical Computer Science,1995
2. S. Arora, Probabilistic checking of proofs and the hardness of approximation problems. Ph.D. Thesis, UC Berkeley, 1994.
3. The hardness of approximate optima in lattices, codes, and systems of linear equations;Arora;Journal of Computer and System Sciences,1997
4. Approximation solutions of NP-optimization problems;Ausiello;Theoretical Computer Science,1995
5. D.A.M. Barrington, P. McKenzie, C. Moore, P. Tesson, D. Thérien, Equation satisfiability and program satisfiability for finite monoids, in: Proceedings of the 25th Annual Symposium on Mathematical Foundations of Computer Science, Bratislava, Slovak Republic, 2000, pp. 172–181.