On the public citation graph
On the Polyhedral Decision Problem
0 signed · 45 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/sapm1975542135openalex-snapshot
The Upper Bound Conjecture and Cohen‐Macaulay Rings
inferredcites →https://doi.org/10.1007/978-3-642-46216-0openalex-snapshot
Convexity and Optimization in Finite Dimensions I
inferredcites →https://doi.org/10.1016/s0022-0000(72)80034-5openalex-snapshot
Proving simultaneous positivity of linear forms
inferredcites →https://doi.org/10.1109/sfcs.1975.20openalex-snapshot
On the complexity of comparison problems using linear functions
inferredcites →https://doi.org/10.1145/322203.322206openalex-snapshot
Information Bounds Are Weak in the Shortest Distance Problem
inferredcites →https://doi.org/10.1145/800105.803391openalex-snapshot
An Ω(n 2 log n) lower bound to the shortest paths problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1999.2788openalex-snapshot
Decision Trees: Old and New Results
inferred← citeshttps://doi.org/10.1006/inco.2000.3012openalex-snapshot
On the Decisional Complexity of Problems Over the Reals
inferred← citeshttps://doi.org/10.1006/jcom.1997.0436openalex-snapshot
Nearly Sharp Complexity Bounds for Multiprocessor Algebraic Computations
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_25openalex-snapshot
Proving lower bounds for linear decision trees
inferred← citeshttps://doi.org/10.1007/3-540-10856-4_99openalex-snapshot
An extension of Rabin's complete proof concept
inferred← citeshttps://doi.org/10.1007/3-540-51517-8_148openalex-snapshot
Towards a refined classification of geometric search and computation problems
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_176openalex-snapshot
On linear decision trees computing Boolean functions
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_23openalex-snapshot
Power of Decision Trees with Monotone Queries
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_4openalex-snapshot
The Information Theoretic Bound for Problems on Ordered Sets and Graphs
inferred← citeshttps://doi.org/10.1007/bf01581271openalex-snapshot
Structure of a simple scheduling polyhedron
inferred← citeshttps://doi.org/10.1007/bf02187869openalex-snapshot
A polynomial-time linear decision tree for the traveling salesman problem and other NP-complete problems
inferred← citeshttps://doi.org/10.1007/bf02218439openalex-snapshot
Exponential lower bounds for some NP-complete problems in a restricted linear decision tree model
inferred← citeshttps://doi.org/10.1007/bf02770873openalex-snapshot
Lower bound on testing membership to a polyhedron by algebraic decision and computation trees
inferred← citeshttps://doi.org/10.1007/bfb0016256openalex-snapshot
On the inherent combinatorial complexity of geometric problems in d - dimensional space
inferred← citeshttps://doi.org/10.1007/bfb0030315openalex-snapshot
Lower bounds for polygon simplicity testing and other problems
inferred← citeshttps://doi.org/10.1007/bfb0030324openalex-snapshot
New lower bound for polyhedral membership problem with an application to linear programming
inferred← citeshttps://doi.org/10.1007/s11786-009-0003-zopenalex-snapshot
Preemptive Scheduling of Equal-Length Jobs in Polynomial Time
inferred← citeshttps://doi.org/10.1016/0196-6774(82)90002-5openalex-snapshot
Lower bounds for algebraic decision trees
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90041-xopenalex-snapshot
Comparisons between linear functions can help
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90210-5openalex-snapshot
Lower bounds on probabilistic linear decision trees
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90334-copenalex-snapshot
Testing the optimality of alphabetic trees
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00082-topenalex-snapshot
Algebraic decision trees and Euler characteristics
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00159-xopenalex-snapshot
Complexity lower bounds for computation trees with elementary transcendental function gates
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267765openalex-snapshot
Algebraic decision trees and Euler characteristics
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365736openalex-snapshot
Complexity lower bounds for computation trees with elementary transcendental function gates
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492481openalex-snapshot
Improved lower bound on testing membership to a polyhedron by algebraic decision trees
inferred← citeshttps://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
inferred← citeshttps://doi.org/10.1137/s0097539790190077openalex-snapshot
A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation Problem
inferred← citeshttps://doi.org/10.1145/195058.195418openalex-snapshot
Lower bounds on testing membership to a polyhedron by algebraic decision trees
inferred← citeshttps://doi.org/10.1145/322203.322206openalex-snapshot
Information Bounds Are Weak in the Shortest Distance Problem
inferred← citeshttps://doi.org/10.1145/800061.808735openalex-snapshot
Lower bounds for algebraic computation trees
inferred← citeshttps://doi.org/10.1287/moor.5.1.1openalex-snapshot
Combinatorial Optimization: What is the State of the Art
inferred← citeshttps://doi.org/10.4153/cjm-1980-010-0openalex-snapshot
On the Extreme Rays of the Metric Cone
inferred← citeshttps://doi.org/10.5555/127787.127838openalex-snapshot
A new lower bound technique and its application: tight lower bound for a polygon triangulation problem
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.