Author:
Bazgan Cristina,Karpinski Marek
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Arora, S., Rao, S., Vazirani, U.: Expander flows and a $\sqrt{\log n}$ -approximation to sparsest cut. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 222–231 (2004)
2. Lecture Notes in Computer Science;M. Blaser,2002
3. Creignou, N.: A dichotomy theorem for maximum generalized satisfiability problems. Journal of Computer and System Sciences 51(3), 511–522 (1995)
4. Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. Monographs on Discrete Mathematics and Applications (2001)
5. Feige, U.: Relations between average case complexity and approximation complexity. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC ), pp. 534–543 (2002)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献