On the public citation graph
Computation complexity of the range of a polynomial in several variables
0 signed · 37 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.1007/bf02241975openalex-snapshot
On computing the range of a rational function of n variables over a bounded region
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470724163.ch1openalex-snapshot
Interval Computation as an Important Part of Granular Computing: An Introduction
inferred← citeshttps://doi.org/10.1007/978-1-4757-2793-7_26openalex-snapshot
Error Estimation for Indirect Measurements: Interval Computation Problem is (Slightly) Harder than a Similar Probabilistic Computational Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-31041-7_15openalex-snapshot
On the Computational Complexity of the Range Computation Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-50583-6_1openalex-snapshot
Utility-Driven Joint Time-and-Power Allocation in Energy-Harvesting Cognitive Radio Relay Networks
inferred← citeshttps://doi.org/10.1007/978-3-032-16494-0_9openalex-snapshot
Asymptotically Tight Algorithm for Checking Whether a Given Vector Is a Solution to a Given Interval-Quantifier Linear System
inferred← citeshttps://doi.org/10.1007/978-3-642-85983-0_6openalex-snapshot
Interval Computations as Propagation of Constraints
inferred← citeshttps://doi.org/10.1007/bf02385263openalex-snapshot
A bright side of NP-hardness of interval computations: interval heuristics applied to NP-problems
inferred← citeshttps://doi.org/10.1007/bf02390521openalex-snapshot
A combined method for enclosing all solutions of nonlinear systems of polynomial equations
inferred← citeshttps://doi.org/10.1007/bf02391700openalex-snapshot
Optimal interval enclosures for fractionally-linear functions, and their application to intelligent control
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.09.017openalex-snapshot
The Interval Analysis of Multilinear Expressions
inferred← citeshttps://doi.org/10.1016/j.fss.2007.11.009openalex-snapshot
Simulation of discrete linear time-invariant fuzzy dynamic systems
inferred← citeshttps://doi.org/10.1016/j.ifacol.2021.08.479openalex-snapshot
Verified Polynomial Controller Synthesis for Disturbed Nonlinear Systems
inferred← citeshttps://doi.org/10.1016/j.phycom.2023.102251openalex-snapshot
Multi-objective optimization for energy efficient cooperative communication in energy-constrained overlay Cognitive Radio Networks
inferred← citeshttps://doi.org/10.1016/j.phycom.2024.102393openalex-snapshot
Many-to-one matching based cooperative spectrum sharing in overlay cognitive radio networks
inferred← citeshttps://doi.org/10.1016/s0004-3702(03)00038-9openalex-snapshot
Fuzzy constraint networks for signal pattern recognition
inferred← citeshttps://doi.org/10.1023/a:1009937906231openalex-snapshot
Computing the Value of a Boolean Expression with Interval Inputs is NP-Hard
inferred← citeshttps://doi.org/10.1023/a:1009946531786openalex-snapshot
An Interval Polynomial Interpolation Problem and Its Lagrange Solution
inferred← citeshttps://doi.org/10.1023/a:1009998515856openalex-snapshot
Algorithms That Still Produce a Solution (Maybe Not Optimal) Even When Interrupted: Shary's Idea Justified
inferred← citeshttps://doi.org/10.1023/a:1021368627321openalex-snapshot
Range Estimation Is NP-Hard for ε2 Accuracy and Feasible for ε2−δ
inferred← citeshttps://doi.org/10.1023/a:1024463631728openalex-snapshot
An NP-Hardness Result for Nonlinear Systems
inferred← citeshttps://doi.org/10.1023/a:1024475901686openalex-snapshot
Why Intervals? Because If We Allow Other Sets, Tractable Problems Become Intractable
inferred← citeshttps://doi.org/10.1023/a:1024666428387openalex-snapshot
Worst-Case Simulation of Discrete Linear Time-Invariant Interval Dynamic Systems
inferred← citeshttps://doi.org/10.1023/a:1025127113561openalex-snapshot
Are There Easy-to-Check Necessary and Sufficient Conditions for Straightforward Interval Computations To Be Exact?
inferred← citeshttps://doi.org/10.1023/a:1026497709529openalex-snapshot
Error Estimation for Indirect Measurements: Interval Computation Problem Is (Slightly) Harder Than a Similar Probabilistic Computational Problem
inferred← citeshttps://doi.org/10.1109/91.554456openalex-snapshot
On hardware support for interval computations and for soft computing: theorems
inferred← citeshttps://doi.org/10.1109/nafips.2011.5752032openalex-snapshot
From single to double use expressions, with applications to parametric interval linear systems: On computational complexity of fuzzy and interval computations
inferred← citeshttps://doi.org/10.1134/s0965542525701301openalex-snapshot
Polynomial Curve Fitting for Data with Interval Uncertainty
inferred← citeshttps://doi.org/10.1134/s199542392503005xopenalex-snapshot
Estimating the Range of a Polynomial Over Interval with Relative Accuracy ε is NP-hard for ε ≤ 1 and Feasible for ε > 1
inferred← citeshttps://doi.org/10.1142/s0218488597000257openalex-snapshot
Interval-Valued Degrees of Belief: Applications of Interval Computations to Expert Systems and Intelligent Control
inferred← citeshttps://doi.org/10.1145/1774088.1774353openalex-snapshot
Polytope-based computation of polynomial ranges
inferred← citeshttps://doi.org/10.1145/232794.232795openalex-snapshot
Computationally complicated problems of numerical computations (in particular, interval computations), biofeedback, computer games, and Gulf War
inferred← citeshttps://doi.org/10.1145/297049.297053openalex-snapshot
From interval computations to modal mathematics
inferred← citeshttps://doi.org/10.4018/978-1-4666-4991-0.ch001openalex-snapshot
Interval Mathematics as a Potential Weapon against Uncertainty
inferred← citeshttps://doi.org/10.48550/arxiv.0908.3954openalex-snapshot
On the Exponentiation of Interval Matrices
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.