Lower bounds based on the Exponential Time Hypothesis

By Daniel Lokshtanov, Daniel Marx, Saket Saurabh. Bull. EATCS, 2011

390 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/77042a24ac267ba3d486c9dc53693e03626c9b80

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Inderjit S. Dhillon
2. Zhao Song
3. Cho-Jui Hsieh
4. Richard Ryan Williams
5. Huan Zhang
6. Joydeep Ghosh
7. Henry Corrigan-Gibbs
8. Dan Boneh

In Computer Networks and Communications

1. Zhao Song
2. Inderjit S. Dhillon
3. Cho-Jui Hsieh
4. Richard Ryan Williams
5. Huan Zhang
6. Ji Liu
7. Jianyu Wang
8. Ce Zhang

Citations in the corpus

• Towards Fast Computation of Certified Robustness for ReLU Networks (2018, background): “For more details, we refer the readers to a survey (Lokshtanov et al., 2013).”
• Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation (2016, background): “tors in K, |F|, d, s, and 1/ε. 2 Hypothesis (ETH) [IPZ01] is that 3-SAT requires 2εn time for some ε>0; ETH has been singularly influential in the area of exact algorithms for NP-hard problems (see [LMS11] for a survey). A more fine-grained version of ETH is the Strong Exponential Time Hypothesis (”