Subject
General Computer Science,Theoretical Computer Science
Reference30 articles.
1. Faster exact algorithms for hard problems: a parameterized point of view;Alber;Discrete Math.,2001
2. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions;Alon;Algorithmica,1996
3. Color-coding;Alon;JACM,1995
4. N. Bansal, V. Raman, Upper bounds for Max-Sat: further improved, in: Proc. ISAAC, Lecture Notes in Computer Science, Vol. 1741, Springer, Berlin, 1999, pp. 247–258.
5. M. Charikar, P. Indyk, R. Panigrahy, New algorithms for subset query, partial match, orthogonal range searching, and related problems, in: Proc. of ICALP, Lecture Notes in Computer Science, Vol. 2380, Springer, Berlin, 2002, pp. 451–462.
Cited by
188 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献