Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices

DOI10.1007/BF01581077zbMATH Open0785.90066OpenAlexW1999692791MaRDI QIDQ687079FDOQ687079

Authors: Ilan Adler, Peter A. Beling 

Publication date: 20 December 1993

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01581077

Recommendations

• Polynomial algorithms for linear programming over the algebraic numbers
• A New Algorithm for Solving Ring-LPN With a Reducible Polynomial
• Polynomial algorithms for \(m\times (m+1)\) integer programs and \(m\times (m+k)\) diophantine systems
• Algorithmic properties of polynomial rings
• scientific article; zbMATH DE number 4077322
• scientific article; zbMATH DE number 1294381
• Asymptotically exact polynomial algorithms in integer linear programming
• scientific article; zbMATH DE number 4181141
• Efficient polynomial algorithms for distributive lattices
• Polynomial algorithms for computing the permanents of some matrices

zbMATH Keywords

circulant matricespolynomial algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Matrix Analysis
• A new polynomial-time algorithm for linear programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Title not available (Why is that?)
• Linear Programming in Linear Time When the Dimension Is Fixed
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Interior path following primal-dual algorithms. I: Linear programming
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Title not available (Why is that?)
• Systems of distinct representatives and linear algebra
• Title not available (Why is that?)
• Title not available (Why is that?)
• Towards a Genuinely Polynomial Algorithm for Linear Programming
• Polynomial algorithms for linear programming over the algebraic numbers
• Title not available (Why is that?)
• Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices

Cited In (3)

• Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
• Polynomial algorithms for linear programming over the algebraic numbers
• Polynomial algorithms for \(m\times (m+1)\) integer programs and \(m\times (m+k)\) diophantine systems

This page was built for publication: Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices

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