Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference30 articles.
1. Models and solution techniques for frequency assignment problems;Aardal;Ann. Oper. Res.,2007
2. Computational Complexity — A Modern Approach;Arora,2009
3. Approximations for lambda-colorings of graphs;Bodlaender;Comput. J.,2004
4. C. Calabro, R. Impagliazzo, R. Paturi, A duality between clause width and clause density for SAT, in: 21st Annual IEEE Conference on Computational Complexity (CCC) 2006, 16–20 July 2006, Prague, Czech Republic, 2006, pp. 252–260.
5. C. Calabro, R. Impagliazzo, R. Paturi, The complexity of satisfiability of small depth circuits, in: Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10–11, 2009, Revised Selected Papers, 2009, pp. 75–85.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献