Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof (2311.05913v3)

Published 10 Nov 2023 in cs.CC and cs.DS

Abstract: Assuming the Exponential Time Hypothesis (ETH), a result of Marx (ToC'10) implies that there is no $f(k)\cdot n{o(k/\log k)}$ time algorithm that can solve 2-CSPs with $k$ constraints (over a domain of arbitrary large size $n$) for any computable function $f$. This lower bound is widely used to show that certain parameterized problems cannot be solved in time $f(k)\cdot n{o(k/\log k)}$ time (assuming the ETH). The purpose of this note is to give a streamlined proof of this result.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (48)
  1. Routing with congestion in acyclic digraphs. Inf. Process. Lett., 151, 2019.
  2. Noga Alon. Eigenvalues and expanders. Combinatorica, 6(2):83–96, 1986.
  3. Noga Alon. Explicit expanders of every degree and size. Combinatorica, pages 1–17, 2021.
  4. Noga Alon. Personal communication, 2023.
  5. λ𝜆\lambdaitalic_λ1, isoperimetric inequalities for graphs, and superconcentrators. Journal of Combinatorial Theory, Series B, 38(1):73–88, 1985.
  6. Sparse balanced partitions and the complexity of subgraph problems. SIAM J. Discret. Math., 25(2):631–644, 2011.
  7. Simultaneous feedback edge set: A parameterized perspective. Algorithmica, 83(2):753–774, 2021.
  8. The inverse voronoi problem in graphs I: hardness. Algorithmica, 82(10):3018–3040, 2020.
  9. On the parameterized complexity of red-blue points separation. In Daniel Lokshtanov and Naomi Nishimura, editors, 12th International Symposium on Parameterized and Exact Computation, IPEC 2017, September 6-8, 2017, Vienna, Austria, volume 89 of LIPIcs, pages 8:1–8:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.
  10. Fine-grained complexity of k-opt in bounded-degree graphs for solving TSP. In Michael A. Bender, Ola Svensson, and Grzegorz Herman, editors, 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany, volume 144 of LIPIcs, pages 23:1–23:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
  11. Hitting set for hypergraphs of low VC-dimension. In Piotr Sankowski and Christos D. Zaroliagis, editors, 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, volume 57 of LIPIcs, pages 23:1–23:18. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016.
  12. Parameterized hardness of art gallery problems. In Piotr Sankowski and Christos D. Zaroliagis, editors, 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, volume 57 of LIPIcs, pages 19:1–19:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016.
  13. The graph motif problem parameterized by the structure of the input graph. Discrete Applied Mathematics, 231:78–94, 2017.
  14. Fixed-parameter tractability of workflow satisfiability in the presence of seniority constraints. In Michael R. Fellows, Xuehou Tan, and Binhai Zhu, editors, Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, Third Joint International Conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013. Proceedings, volume 7924 of Lecture Notes in Computer Science, pages 198–209. Springer, 2013.
  15. Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths. In Petra Mutzel, Rasmus Pagh, and Grzegorz Herman, editors, 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference), volume 204 of LIPIcs, pages 34:1–34:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
  16. Homomorphisms are a good basis for counting small subgraphs. In Hamed Hatami, Pierre McKenzie, and Valerie King, editors, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017, pages 210–223. ACM, 2017.
  17. Almost tight lower bounds for hard cutting problems in embedded graphs. J. ACM, 68(4):30:1–30:26, 2021.
  18. Tight bounds for graph homomorphism and subgraph isomorphism. In Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, pages 1643–1649. SIAM, 2016.
  19. Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions). SIAM J. Comput., 49(2):318–364, 2020.
  20. Parameterized approximation algorithms for bidirected Steiner network problems. ACM Trans. Algorithms, 17(2):12:1–12:68, 2021.
  21. Jeff Cheeger. A lower bound for the smallest eigenvalue of the Laplacian, problems in analysis (papers dedicated to salomon bochner, 1969), 1970.
  22. On the computational hardness based on linear FPT-reductions. J. Comb. Optim., 11(2):231–247, 2006.
  23. Strong computational lower bounds via parameterized complexity. J. Comput. Syst. Sci., 72(8):1346–1367, 2006.
  24. Parameterizing the permanent: Genus, apices, minors, evaluation mod 2k. In Venkatesan Guruswami, editor, IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pages 994–1009. IEEE Computer Society, 2015.
  25. Parameterized complexity of hotelling-downs with party nominees. In Luc De Raedt, editor, Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022, pages 244–250. ijcai.org, 2022.
  26. Exponential time complexity of the permanent and the tutte polynomial. ACM Trans. Algorithms, 10(4):21:1–21:32, 2014.
  27. Dominique de Werra. Decomposition of bipartite multigraphs into matchings. Zeitschrift für Operations Research, 16:85–90, 1972.
  28. Preference swaps for the stable matching problem. Theor. Comput. Sci., 940(Part):222–230, 2023.
  29. Complexity of the Steiner network problem with respect to the number of terminals. CoRR, abs/1802.08189, 2018.
  30. The parameterized complexity of finding point sets with hereditary properties. CoRR, abs/1808.02162, 2018.
  31. On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci., 410(1):53–61, 2009.
  32. On the optimality of pseudo-polynomial algorithms for integer programming. Math. Program., 198(1):561–593, 2023.
  33. The parameterized complexity of local search for tsp, more refined. Algorithmica, 67(1):89–110, 2013.
  34. Random contractions and sampling for hypergraph and hedge connectivity. In Philip N. Klein, editor, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, pages 1101–1114. SIAM, 2017.
  35. On the complexity of k-SAT. J. Comput. Syst. Sci., 62(2):367–375, 2001.
  36. Which problems have strongly exponential complexity? J. Comput. Syst. Sci., 63(4):512–530, 2001.
  37. Bin packing with fixed number of bins revisited. J. Comput. Syst. Sci., 79(1):39–49, 2013.
  38. A tight quasi-polynomial bound for global label min-cut. In Nikhil Bansal and Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pages 290–303. SIAM, 2023.
  39. Parameterized complexity of directed Steiner tree on sparse graphs. SIAM J. Discrete Math., 31(2):1294–1327, 2017.
  40. Balancing the spread of two opinions in sparse social networks (student abstract). In Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022, pages 12987–12988. AAAI Press, 2022.
  41. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM, 46(6):787–832, 1999.
  42. Parameterized complexity and approximability of directed odd cycle transversal. In Shuchi Chawla, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, pages 2181–2200. SIAM, 2020.
  43. Dániel Marx. Can you beat treewidth? Theory of Computing, 6(1):85–112, 2010.
  44. Explicit near-ramanujan graphs of every degree. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pages 510–523, 2020.
  45. Optimal parameterized algorithms for planar facility location problems using voronoi diagrams. In Nikhil Bansal and Irene Finocchi, editors, Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, volume 9294 of Lecture Notes in Computer Science, pages 865–877. Springer, 2015.
  46. Jesper Nederlof and Céline M. F. Swennenhuis. On the fine-grained parameterized complexity of partial scheduling to minimize the makespan. Algorithmica, 84(8):2309–2334, 2022.
  47. Directed multicut is W[1]-hard, even for four terminal pairs. TOCT, 10(3):13:1–13:18, 2018.
  48. Craig A. Tovey. A simplified NP-complete satisfiability problem. Discret. Appl. Math., 8(1):85–89, 1984.
Citations (8)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now