Fedor V. Fomin
- Bax, E.T. Inclusion and exclusion algorithm for the Hamiltonian path problem. Inf. Process, Lett. 47, 4 (1993), 203--207. Google Scholar
Digital Library
- Bellman, R. Dynamic Programming, Princeton University Press, 1957.Google Scholar
- Bellman, R. Dynamic programming treatment of the travelling salesman problem. J. ACM 9 (1962), 61--63. Google ScholarDigital Library
- Björklund, A. Determinant sums for undirected hamiltonicity. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010) (2010), IEEE, 173--182. Google ScholarDigital Library
- Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M. Narrow sieves for parameterized paths and packings. arXiv:1007.1161 (2010).Google Scholar
- Björklund, A., Husfeldt, T., Koivisto, M. Set partitioning via inclusion-exclusion. SIAM J. Comput. 39, 2 (2009), 546--563. Google ScholarDigital Library
- Coppersmith, D., Winograd, S. Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9, 3 (1990), 251--280. Google ScholarDigital Library
- Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J.M.M., Wojtaszczyk, J.O. Solving connectivity problems parameterized by treewidth in single exponential time. In Proceedings of the 52nd Annual Symposium on Foundations of ComputerScience (2011), IEEE, 150--159. Google ScholarDigital Library
- Dantsin, E., Hirsch, E.A. Worst-case upper bounds. In Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications. IOS Press, 2009, 403--424.Google Scholar
- Downey, R.G., Fellows, M.R. Parameterized Complexity, Springer, 1999.Google Scholar
- Eppstein, D. Small maximal independent sets and faster exact graph coloring. J. Graph Algorithms Appl. 7, 2 (2003), 131--140.Google ScholarCross Ref
- Eppstein, D. Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms. ACM Trans. Algorithms 2, 4 (2006), 492--509. Google ScholarDigital Library
- Flum, J., Grohe, M. Parameterized Complexity Theory, Springer, 2006. Google ScholarDigital Library
- Fomin, F.V., Grandoni, F., Kratsch, D. A measure&conquer approach for the analysis of exact algorithms. J. ACM 56, 5 (2009). Google ScholarDigital Library
- Fomin, F.V., Kratsch, D. Exact Exponential Algorithms, Springer, 2010. Google ScholarDigital Library
- Fortnow, L. The status of the P versus NP problem. Commun. ACM 52, 9 (2009), 78--86. Google ScholarDigital Library
- Garey, M.R., Johnson, D.S. Computers and Intractability, A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, 1979. Google ScholarDigital Library
- Golomb, S.W., Baumert, L.D. Backtrack programming. J. ACM 12 (1965), 516--524. Google ScholarDigital Library
- Held, M., Karp, R.M. A dynamic programming approach to sequencing problems. J. Soc. Indust. Appl. Math. 10 (1962), 196--210.Google ScholarCross Ref
- Holyer, I. The NP-completeness of edge-coloring. SIAM J. Comput. 10, 4 (1981), 718--720.Google Scholar
- Husfeldt, T. Invitation to algorithmic uses of inclusion--exclusion. arXiv:1105.2942 (2011). Google ScholarDigital Library
- Itai, A., Rodeh, M. Finding a minimum circuit in a graph. SIAM J. Comput. 7, 4 (1978), 413--423.Google ScholarCross Ref
- Karp, R.M. Dynamic programming meets the principle of inclusion and exclusion. Oper. Res. Lett. 1, 2 (1982), 49--51. Google ScholarDigital Library
- Knuth, D.E. The Art of Computer Programming, vol. 2: Seminumerical Algorithms, 3rd edn, Addison-Wesley, 1998. Google ScholarDigital Library
- Kohn, S., Gottlieb, A., Kohn, M. A generating function approach to the traveling salesman problem. In Proceedings of the ACM Annual Conference (ACM 1977) (1977), ACM Press, 294--300. Google ScholarDigital Library
- Koivisto, M. Optimal 2-constraint satisfaction via sum-product algorithms. Inform. Process. Lett. 98, 1 (2006), 24--28. Google ScholarDigital Library
- Lawler, E.L. A note on the complexity of the chromatic number problem. Inf. Process. Lett. 5, 3 (1976), 66--67.Google ScholarCross Ref
- Malik, S., Zhang, L. Boolean satisfiability: From theoretical hardness to practical success. Commun. ACM 52, 8 (2009), 76--82. Google ScholarDigital Library
- Moon, J.W., Moser, L. On cliques in graphs. Israel J. Math. 3 (1965), 23--28.Google ScholarCross Ref
- Mulmuley, K., Vazirani, U.V., Vazirani, V.V. Matching is as easy as matrix inversion. Combinatorica 7, 1 (1987), 105--113. Google ScholarDigital Library
- Niedermeier, R. Invitation to Fixed-Parameter Algorithms, Oxford University Press, 2006.Google Scholar
- Strassen, V. Gaussian elimination is not optimal. Numer. Math. 13 (1969), 354--356.Google ScholarDigital Library
- Vassilevska Williams, V. Multiplying matrices faster than Coppersmith-Winograd. In Proceedings of 44th ACM Symposium on Theory of Computing (STOC 2012) (2012), ACM, 887--898. Google ScholarDigital Library
- Vazirani, V.V. Approximation Algorithms, Springer, 2001. Google ScholarDigital Library
- Walker, R.J. An enumerative technique for a class of combinatorial problems. In Proceedings of Symposia in Applied Mathematics, vol. 10, American Mathematical Society, 1960, 91--94.Google Scholar
- Williams, R. A new algorithm for optimal 2-constraint satisfaction and its implications. Theoret. Comput. Sci. 348, 2--3 (2005), 357--365. Google ScholarDigital Library
- Williams, R. Improving exhaustive search implies superpolynomial lower bounds. In Proceedings of 42nd ACM Symposium on Theory of Computing (2010), ACM, 231--240. Google ScholarDigital Library
- Woeginger, G. Exact algorithms for NP-hard problems: a survey. In Combinatorial Optimization - Eureka, You Shrink! (2003), volume 2570 of Lecture Notes in Computer Science, Springer, 185--207. Google ScholarDigital Library
- Woeginger, G. Space and time complexity of exact algorithms: some open problems. In Proceedings of the 1st International Workshop on Parameterized and Exact Computation (2004), volume 3162 of Lecture Notes in Computer Science, Springer, 281--290.Google ScholarCross Ref
- Yates, F. The Design and Analysis of Factorial Experiments, Imperial Bureau of Soil Science, 1937.Google Scholar
- Zykov, A.A. On some properties of linear complexes. Mat. Sbornik N.S. 24, 66 (1949), 163--188.Google Scholar
Index Terms
- Exact exponential algorithms
Recommendations
Nontriviality for exponential time w.r.t. weak reducibilities
A set A is nontrivial for the linear exponential time class E=DTIME(2^l^i^n) if A@?E and the sets from E which can be reduced to A are not from a single level DTIME(2^k^n) of the linear exponential hierarchy. Similarly, a set A is nontrivial for the ...
Parameterized and Exact-Exponential Algorithms for the Read-Once Integer Refutation Problem in UTVPI Constraints
Combinatorial Optimization and ApplicationsAbstractIn this paper, we discuss parameterized and exact-exponential algorithms for the read-once integer refutability problem in Unit Two Variable Per Inequality (UTVPI) constraint systems. UTVPI constraint systems (UCSs) arise in a number of domains ...
Nontriviality for exponential time w.r.t weak reducibilities
TAMC'10: Proceedings of the 7th annual conference on Theory and Applications of Models of ComputationA set A is nontrivial for the linear exponential time class E=DTIME(2lin) if A∈E and the sets from E which can be reduced to A are not from a single level DTIME(2kn) of the linear exponential hierarchy Similarly, a set A is nontrivial for the polynomial ...
Comments