Feasible algorithms for lattice and directed subspaces

DOI10.3318/pria.2014.114.11zbMath1311.06016MaRDI QIDQ2938997

Jennifer del Valle, Vladik Ya. Kreinovich, Piotr J. Wojciechowski

Publication date: 16 January 2015

Published in: Mathematical Proceedings of the Royal Irish Academy (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3108e82e9598eded8b4669383b44f45a1e55d225

zbMATH Keywords

lattices; feasible algorithms; directed ordered spaces; linear subspaces of \(\mathbb R^m\)

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

06F25: Ordered rings, algebras, modules

06-04: Software, source code, etc. for problems pertaining to ordered structures