Pages that link to "Item:Q4267801"
From MaRDI portal
The following pages link to Lower bounds for linear satisfiability problems (Q4267801):
Displaying 16 items.
- 3SUM, 3XOR, triangles (Q261365) (← links)
- On the least trimmed squares estimator (Q472475) (← links)
- Necklaces, convolutions, and \(X+Y\) (Q517795) (← links)
- Approximating maximum satisfiable subsystems of linear equations of bounded width (Q963367) (← links)
- Lower bounds for some decision problems over \(C\) (Q1605321) (← links)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- Subquadratic algorithms for 3SUM (Q2482729) (← links)
- Some lower bound results for set-multilinear arithmetic computations (Q2808533) (← links)
- Linear FPT reductions and computational lower bounds (Q3580971) (← links)
- Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width (Q4914311) (← links)
- Complexity Results for Linear XSAT-Problems (Q4930593) (← links)
- On Multidimensional and Monotone k-SUM (Q5111265) (← links)
- Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity (Q5941296) (← links)
- Results related to threshold phenomena research in satisfiability: Lower bounds (Q5958805) (← links)