scientific article; zbMATH DE number 1643917
From MaRDI portal
Publication:2739433
zbMATH Open0988.11057MaRDI QIDQ2739433
Publication date: 9 July 2002
Title of this publication is not available (Why is that?)
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)
Related Items (12)
Lattice equations and their solutions with complexity of polynomial class ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Lattice problems in NP ∩ coNP ⋮ Enumeration results on linear complexity profiles and lattice profiles ⋮ Difficult configurations -- on the complexity of LTrL ⋮ Inapproximability Results for Computational Problems on Lattices ⋮ Title not available (Why is that?) ⋮ LCM Lattices and Stanley Depth: A First Computational Approach ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ On the trellis complexity of root lattices and their duals
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2739433)
