Deterministic and randomized polynomial‐time approximation of radii (Q4435530): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q101069426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Computing the Volume of a Polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Bodies with Few Faces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on proof verification and approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of norm-maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Helly's theorem: Algorithms and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350884 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of the Sphere by Polytopes having Few Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the volume is difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The law of large numbers and the central limit theorem in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a polytope to approximate a convex body / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some basic problems in computational convexity. I. Containment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric inequality with applications to linear forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4041061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of four polyhedral set containment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric inequality and the complexity of computing volume / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gelfand numbers of operators with values in a Hilbert space / rank
 
Normal rank

Latest revision as of 12:21, 6 June 2024

scientific article; zbMATH DE number 2003646
Language Label Description Also known as
English
Deterministic and randomized polynomial‐time approximation of radii
scientific article; zbMATH DE number 2003646

    Statements

    Deterministic and randomized polynomial‐time approximation of radii (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 November 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references