On the public citation graph

Dines—Fourier—Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields

0 signed · 36 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-9872-4openalex-snapshot
Lectures in Abstract Algebra
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_3openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.1007/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1016/0024-3795(90)90052-eopenalex-snapshot
Relationships of properties of piecewise affine maps over ordered fields
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/c2009-0-22107-6openalex-snapshot
A Mathematical Introduction to Logic
inferredcites →https://doi.org/10.1016/s0747-7171(88)80003-8openalex-snapshot
The complexity of linear problems in fields
inferredcites →https://doi.org/10.1017/s002555720024391xopenalex-snapshot
Lectures in Abstract Algebra : vol. III, Theory of Fields and Galois Theory. By N. Jacobson. Pp. xi, 323. 76s. (Van Nostrand)
inferredcites →https://doi.org/10.1137/0326023openalex-snapshot
Invariant Polynomial Curves of Piecewise Linear Maps
inferredcites →https://doi.org/10.1137/1.9780898719468openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.1145/800057.808695openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1287/moor.14.3.502openalex-snapshot
A Theory on Extending Algorithms for Parametric Problems
inferredcites →https://doi.org/10.1287/moor.5.3.366openalex-snapshot
Invariant Half-Lines of Nonexpansive Piecewise-Linear Transformations
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.1525/9780520348097openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.2307/1967869openalex-snapshot
Systems of Linear Inequalities
inferredcites →https://doi.org/10.2307/1969640openalex-snapshot
A New Decision Method for Elementary Algebra
inferredcites →https://doi.org/10.2307/2004942openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.7249/r366openalex-snapshot
Linear Programming and Extensions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/1097-0207(20000820)48:11<1583::aid-nme962>3.0.co;2-wopenalex-snapshot
Derivation of feasibility conditions in engineering problems under parametric inequality constraints with classical Fourier elimination
inferred← citeshttps://doi.org/10.1006/jsco.1997.0122openalex-snapshot
Simulation and Optimization by Quantifier Elimination
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_143openalex-snapshot
FOURIER—MOTZKIN ELIMINATION METHOD
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_34openalex-snapshot
TReX: A Tool for Reachability Analysis of Complex Systems
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_187openalex-snapshot
Fourier–Motzkin Elimination Method
inferred← citeshttps://doi.org/10.1007/bf01581699openalex-snapshot
Formulation of linear problems and solution by a universal machine
inferred← citeshttps://doi.org/10.1007/s00012-010-0056-5openalex-snapshot
A representation of convex semilinear sets
inferred← citeshttps://doi.org/10.1007/s10559-010-9239-5openalex-snapshot
Solving linear constraints over real and rational fields
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50014-xopenalex-snapshot
Solving Numerical Constraints
inferred← citeshttps://doi.org/10.1090/s0002-9939-96-03352-7openalex-snapshot
Locally injective maps in o-minimal structures without poles are surjective
inferred← citeshttps://doi.org/10.1109/tse.2006.71openalex-snapshot
TCTL Inevitability Analysis of Dense-Time Systems: From Theory to Engineering
inferred← citeshttps://doi.org/10.1137/0802031openalex-snapshot
Linear Inequality Scaling Problems
inferred← citeshttps://doi.org/10.1145/2160910.2160912openalex-snapshot
Parameterized loop tiling
inferred← citeshttps://doi.org/10.1287/moor.1090.0427openalex-snapshot
Accuracy Certificates for Computational Problems with Convex Structure
inferred← citeshttps://doi.org/10.1287/moor.2013.0629openalex-snapshot
An Exact Correspondence of Linear Problems and Randomizing Linear Algorithms
inferred← citeshttps://doi.org/10.36045/bbms/1105730626openalex-snapshot
A survey on real structural complexity theory
inferred← citeshttps://doi.org/10.70675/355d0679zdae2z42d3za970za4e69ef8a144openalex-snapshot
Tropical spectrahedra : Application to semidefinite programming and mean payoff games
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.