Combinatorial Complexity Bounds for Arrangements of Curves and Spheres

Discrete and Computational Geometry - United States
doi 10.1007/bf02187783
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Combinatorial Bounds of Overfitting for Threshold Classifiers

Ufa Mathematical Journal
2018English

Regions Cut by Arrangements of Topological Spheres

Canadian Mathematical Bulletin
Mathematics
1993English

Upper Bounds for Packings of Spheres of Several Radii

Forum of Mathematics, Sigma
StatisticsProbabilityAlgebraCombinatoricsAnalysisNumber TheoryGeometryMathematical PhysicsDiscrete MathematicsComputational MathematicsTheoretical Computer ScienceTopology
2014English

Onk-Sets in Arrangements of Curves and Surfaces

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1991English

Symmetric Sets of Curves and Combinatorial Arrays

Contemporary Mathematics
Mathematics
1999English

Combinatorial Interpretation of Kolmogorov Complexity

English

Local Solubility and Height Bounds for Coverings of Elliptic Curves

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2012English

Sharp Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2004English

Average-Case Bounds for the Complexity of Path-Search

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
1998English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy