Formulation of linear problems and solution by a universal machine
From MaRDI portal
Publication:1338141
DOI10.1007/BF01581699zbMath0809.90099MaRDI QIDQ1338141
Uriel G. Rothblum, B. Curtis Eaves
Publication date: 27 November 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Linear programming (90C05) Logic in computer science (03B70) Turing machines and related notions (03D10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of linear problems in fields
- Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- Complexity of deciding Tarski algebra
- Formulation of linear problems and solution by a universal machine
- A new decision method for elementary algebra
- Invariant Polynomial Curves of Piecewise Linear Maps
- A Theory on Extending Algorithms for Parametric Problems
- How to Pick Out the Integers in the Rationals: An Application of Number Theory to Logic
- Proof of Recursive Unsolvability of Hilbert's Tenth Problem
- A finite procedure for determining if a quadratic form is bounded below on a closed polyhedral convex set
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
This page was built for publication: Formulation of linear problems and solution by a universal machine
