Conditional Lower Bounds for Failed Literals and Related Techniques

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-09284-3_7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Lower Bounds for Adaptive Collect and Related Objects

2004English

Improved Techniques for Lower Bounds for Odd Perfect Numbers

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1991English

Lower Bounds

2016English

Lower Bounds for Subgraph Isomorphism

2019English

Lower Bounds for Z-Numbers

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2009English

Lower Bounds for Dynamic Connectivity

2004English

Lower Bounds for Swapping Arthur and Merlin

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

Lower Bounds for Measurable Chromatic Numbers

Geometric and Functional Analysis
GeometryAnalysisTopology
2009English

Calculating Lower Bounds for Caching Problems

Computing (Vienna/New York)
Numerical AnalysisComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTheoretical Computer ScienceSoftware
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy