Author:
Barland Ian,Kolaitis Phokion G,Thakur Madhukar N
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference17 articles.
1. The complexity and approximability of finding maximum feasible subsystems of linear relations;Amaldi;Theor. Comput. Sci.,1995
2. Proof verification and hardness of approximation problems;Arora,1992
3. S. Arora, S. Safra, Approximating clique is NP-complete, Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992
4. Optimization problems: Expressibility, approximation properties and expected asymptotic growth of optimal solutions;Behrendt,1992
5. M. Bellare, Interactive proofs and approximation: Reductions from two provers in one round, Proceedings of the second Israel Symposium on Theory of Computer Science, IEEE, June 1993
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献