scientific article; zbMATH DE number 910895
From MaRDI portal
zbMATH Open0849.68041MaRDI QIDQ4886070FDOQ4886070
Authors: Jeff Erickson 
Publication date: 28 July 1996
Title of this publication is not available (Why is that?)
Recommendations
General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Real and complex fields (12D99)
Cited In (17)
- Lower bounds for some decision problems over \(C\)
- Lower bounds for linear degeneracy testing
- Finding submasses in weighted strings with fast Fourier transform
- Results related to threshold phenomena research in satisfiability: Lower bounds
- Linear FPT reductions and computational lower bounds
- A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model
- Complexity Results for Linear XSAT-Problems
- \(k\)-SUM in the sparse regime: complexity and applications
- Arboral satisfaction: recognition and LP approximation
- Exact weight subgraphs and the \(k\)-sum conjecture
- Some lower bound results for set-multilinear arithmetic computations
- Some geometric lower bounds
- Improved subquadratic 3SUM
- Improved bounds for 3SUM, \(k\)-SUM, and linear degeneracy
- Title not available (Why is that?)
- On 3SUM-hard problems in the decision tree model
- Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886070)
