Amanote Research

Amanote Research

    RegisterSign In

New Lower Bounds for Hopcroft's Problem

Discrete and Computational Geometry - United States
doi 10.1007/bf02712875
Full Text
Open PDF
Abstract

Available in full text

Categories
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
Date

April 1, 1996

Authors
J. Erickson
Publisher

Springer Science and Business Media LLC


Related search

Minimax Lower Bounds for the Two-Armed Bandit Problem

SSRN Electronic Journal
1997English

Entropy, Some New Lower Bounds

English

Tabu Search and Lower Bounds for a Combined Production–transportation Problem

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2013English

Dual Vectors and Lower Bounds for the Nearest Lattice Point Problem

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
1988English

New Error Bounds for the Linear Complementarity Problem

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
1994English

Lower Bounds

2016English

Lower Bounds for Subgraph Isomorphism

2019English

Lower Bounds for Z-Numbers

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2009English

Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy