Shrinking Lattice Polyhedra

DOI10.1137/0403029MaRDI QIDQ3496855zbMATH OpenOpenAlexFDO

Authors Susan Landau, John E. Cremona

Publication date 1990

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0403029

zbMATH Keywords

complexity of algorithmsnumber theory of quaternionssimilarity between lattice polyhedra

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Number-theoretic algorithms; complexity (11Y16) Polyhedra and polytopes; regular figures, division of spaces (51M20) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Shrinking integer lattices. II
• Embedding a polytope in a lattice
• Steinhaus' lattice point problem for polyhedra
• On Counting Lattice Points in Polyhedra
• Lattice size and generalized basis reduction in dimension three

Cited in

(3)

• Shrinking integer lattices. II
• Shrinking integer lattices
• scientific article; zbMATH DE number 7289925 (Why is no real title available?)

This page was built for publication: Shrinking Lattice Polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3496855)