Amanote Research

Amanote Research

    RegisterSign In

A Polynomial-Time Algorithm to Approximate the Mixed Volume Within a Simply Exponential Factor

Discrete and Computational Geometry - United States
doi 10.1007/s00454-009-9147-5
Full Text
Open PDF
Abstract

Available in full text

Categories
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
Date

February 26, 2009

Authors
Leonid Gurvits
Publisher

Springer Science and Business Media LLC


Related search

A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies

1989English

Normalizes and Permutational Isomorphisms in Simply-Exponential Time

2020English

A Polynomial Time Algorithm for Fault Diagnosability

1984English

A Polynomial-Time Algorithm for Global Value Numbering

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

A Polynomial-Time Parsing Algorithm for TT-MCTAG

2009English

Exploring How to Simply Approximate the P-Value of a Chi-Squared Statistic

Austrian Journal of Statistics
UncertaintyApplied MathematicsStatisticsProbability
2018English

A Polynomial Time Algorithm for Spatio-Temporal Security Games

2017English

From the Cover: Approximate Protein Structural Alignment in Polynomial Time

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
2004English

A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns

IEEE/ACM Transactions on Computational Biology and Bioinformatics
BiotechnologyApplied MathematicsGenetics
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy