Matches in SemOpenAlex for { <https://semopenalex.org/work/W4385225020> ?p ?o ?g. }
Showing items 1 to 65 of
65
with 100 items per page.
- W4385225020 abstract "The field of fine-grained complexity aims at proving conditional lower bounds on the time complexity of computational problems. One of the most popular assumptions, Strong Exponential Time Hypothesis (SETH), implies that SAT cannot be solved in $2^{(1-epsilon)n}$ time. In recent years, it has been proved that known algorithms for many problems are optimal under SETH. Despite the wide applicability of SETH, for many problems, there are no known SETH-based lower bounds, so the quest for new reductions continues. Two barriers for proving SETH-based lower bounds are known. Carmosino et al. (ITCS 2016) introduced the Nondeterministic Strong Exponential Time Hypothesis (NSETH) stating that TAUT cannot be solved in time $2^{(1-epsilon)n}$ even if one allows nondeterminism. They used this hypothesis to show that some natural fine-grained reductions would be difficult to obtain: proving that, say, 3-SUM requires time $n^{1.5+epsilon}$ under SETH, breaks NSETH and this, in turn, implies strong circuit lower bounds. Recently, Belova et al. (SODA 2023) introduced the so-called polynomial formulations to show that for many NP-hard problems, proving any explicit exponential lower bound under SETH also implies strong circuit lower bounds. We prove that for a range of problems from P, including $k$-SUM and triangle detection, proving superlinear lower bounds under SETH is challenging as it implies new circuit lower bounds. To this end, we show that these problems can be solved in nearly linear time with oracle calls to evaluating a polynomial of constant degree. Then, we introduce a strengthening of SETH stating that solving SAT in time $2^{(1-varepsilon)n}$ is difficult even if one has constant degree polynomial evaluation oracle calls. This hypothesis is stronger and less believable than SETH, but refuting it is still challenging: we show that this implies circuit lower bounds." @default.
- W4385225020 created "2023-07-25" @default.
- W4385225020 creator A5045174507 @default.
- W4385225020 creator A5045774141 @default.
- W4385225020 creator A5060506774 @default.
- W4385225020 creator A5071750712 @default.
- W4385225020 creator A5090623773 @default.
- W4385225020 creator A5092536181 @default.
- W4385225020 date "2023-07-21" @default.
- W4385225020 modified "2023-09-27" @default.
- W4385225020 title "Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds" @default.
- W4385225020 doi "https://doi.org/10.48550/arxiv.2307.11444" @default.
- W4385225020 hasPublicationYear "2023" @default.
- W4385225020 type Work @default.
- W4385225020 citedByCount "0" @default.
- W4385225020 crossrefType "posted-content" @default.
- W4385225020 hasAuthorship W4385225020A5045174507 @default.
- W4385225020 hasAuthorship W4385225020A5045774141 @default.
- W4385225020 hasAuthorship W4385225020A5060506774 @default.
- W4385225020 hasAuthorship W4385225020A5071750712 @default.
- W4385225020 hasAuthorship W4385225020A5090623773 @default.
- W4385225020 hasAuthorship W4385225020A5092536181 @default.
- W4385225020 hasBestOaLocation W43852250201 @default.
- W4385225020 hasConcept C114614502 @default.
- W4385225020 hasConcept C115903868 @default.
- W4385225020 hasConcept C118615104 @default.
- W4385225020 hasConcept C134306372 @default.
- W4385225020 hasConcept C151376022 @default.
- W4385225020 hasConcept C176181172 @default.
- W4385225020 hasConcept C311688 @default.
- W4385225020 hasConcept C33923547 @default.
- W4385225020 hasConcept C41008148 @default.
- W4385225020 hasConcept C55166926 @default.
- W4385225020 hasConcept C71017364 @default.
- W4385225020 hasConcept C77553402 @default.
- W4385225020 hasConcept C90119067 @default.
- W4385225020 hasConceptScore W4385225020C114614502 @default.
- W4385225020 hasConceptScore W4385225020C115903868 @default.
- W4385225020 hasConceptScore W4385225020C118615104 @default.
- W4385225020 hasConceptScore W4385225020C134306372 @default.
- W4385225020 hasConceptScore W4385225020C151376022 @default.
- W4385225020 hasConceptScore W4385225020C176181172 @default.
- W4385225020 hasConceptScore W4385225020C311688 @default.
- W4385225020 hasConceptScore W4385225020C33923547 @default.
- W4385225020 hasConceptScore W4385225020C41008148 @default.
- W4385225020 hasConceptScore W4385225020C55166926 @default.
- W4385225020 hasConceptScore W4385225020C71017364 @default.
- W4385225020 hasConceptScore W4385225020C77553402 @default.
- W4385225020 hasConceptScore W4385225020C90119067 @default.
- W4385225020 hasLocation W43852250201 @default.
- W4385225020 hasOpenAccess W4385225020 @default.
- W4385225020 hasPrimaryLocation W43852250201 @default.
- W4385225020 hasRelatedWork W1523547988 @default.
- W4385225020 hasRelatedWork W1531835879 @default.
- W4385225020 hasRelatedWork W1973386461 @default.
- W4385225020 hasRelatedWork W2059442203 @default.
- W4385225020 hasRelatedWork W23339264 @default.
- W4385225020 hasRelatedWork W2465024128 @default.
- W4385225020 hasRelatedWork W2811370865 @default.
- W4385225020 hasRelatedWork W3038444735 @default.
- W4385225020 hasRelatedWork W4298134395 @default.
- W4385225020 hasRelatedWork W59272652 @default.
- W4385225020 isParatext "false" @default.
- W4385225020 isRetracted "false" @default.
- W4385225020 workType "article" @default.