Pages that link to "Item:Q2800573"
From MaRDI portal
The following pages link to Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility (Q2800573):
Displaying 22 items.
- A short note on Merlin-Arthur protocols for subset sum (Q344519) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
- Fine-grained complexity theory: conditional lower bounds for computational geometry (Q2117766) (← links)
- Scheduling lower bounds via AND subset sum (Q2121467) (← links)
- Subquadratic algorithms for succinct stable matching (Q2415371) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- (Q4638059) (← links)
- (Q4638076) (← links)
- A Hierarchy Theorem for Interactive Proofs of Proximity (Q4638092) (← links)
- (Q4638096) (← links)
- (Q4993281) (← links)
- (Q5009621) (← links)
- Fine-Grained Complexity Theory (Tutorial) (Q5090450) (← links)
- Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. (Q5091156) (← links)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
- Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy (Q5111730) (← links)
- Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (Q5130843) (← links)
- (Q5158499) (← links)
- Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)
