Amanote Research

Amanote Research

    RegisterSign In

On the Complexity of Polyhedral Separability

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

Available in full text

Categories
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
Date

December 1, 1988

Authors
Nimrod Megiddo
Publisher

Springer Science and Business Media LLC


Related search

On Polyhedral Product Spaces Over Polyhedral Joins

Homology, Homotopy and Applications
Mathematics
2018English

On the Mobility of Polyhedral Virus

Journal of the agricultural chemical society of Japan
1953English

QUASI-separability and Hierarchical QUASI-separability in Stochastic Signal Processing

2005English

On the Polyhedral Cones of Convex and Concave Vectors

Mathematics for Application
2015English

Weak Star Separability

Bulletin of the Australian Mathematical Society
Mathematics
1979English

Complete Family of Separability Criteria

Physical Review A
2004English

Development and the Continuum of Dimensional Separability

Perception & Psychophysics
1980English

Extrinsic Value and the Separability of Reasons

2016English

Separability of Stochastic Processes

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1963English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy