Deciding whether a lattice has an orthonormal basis is in co-NP
From MaRDI portal
Publication:6634539
DOI10.1007/s10107-023-02052-1MaRDI QIDQ6634539
Publication date: 7 November 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing isometries of lattices
- A characterization of the \(\mathbb Z^ n\) lattice
- Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)
- Lattices with symmetry
- Finding a Closest Point in a Lattice of Voronoi's First Kind
- Complexity and algorithms for computing Voronoi cells of lattices
- Characteristic Elements of Unimodular -lattices
- Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP)
- Deciding Orthogonality in Construction-A Lattices
- On the Lattice Isomorphism Problem
- Systems of distinct representatives and linear algebra
- Combinatorial optimization. Theory and algorithms.
- On quadratic forms.
This page was built for publication: Deciding whether a lattice has an orthonormal basis is in co-NP
