On the public citation graph

On the Sum of Square Roots of Polynomials and Related Problems

0 signed · 34 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/11821069_22openalex-snapshot
On Comparing Sums of Square Roots of Small Integers
inferredcites →https://doi.org/10.1007/978-3-642-58575-3openalex-snapshot
Introduction to Coding Theory
inferredcites →https://doi.org/10.1007/bf02985791openalex-snapshot
Integers and polynomials: comparing the close cousins Z and F q [x]
inferredcites →https://doi.org/10.1007/s004530010005openalex-snapshot
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals
inferredcites →https://doi.org/10.1016/0885-064x(92)90003-topenalex-snapshot
A problem that is easier to solve on the unit-cost algebraic RAM
inferredcites →https://doi.org/10.1016/j.ipl.2006.05.002openalex-snapshot
How much precision is needed to compare two sums of square roots of integers?
inferredcites →https://doi.org/10.1016/j.tcs.2007.08.008openalex-snapshot
The complexity of two problems on arithmetic circuits
inferredcites →https://doi.org/10.1090/s0002-9904-1900-00771-3openalex-snapshot
On linear dependence of functions of one variable
inferredcites →https://doi.org/10.1090/s0025-5718-09-02304-7openalex-snapshot
Bounding the sum of square roots via lattice reduction
inferredcites →https://doi.org/10.1109/sfcs.1991.185434openalex-snapshot
Computing sums of radicals in polynomial time
inferredcites →https://doi.org/10.1137/0221053openalex-snapshot
On Threshold Circuits and Polynomial Computation
inferredcites →https://doi.org/10.1137/070697926openalex-snapshot
On the Complexity of Numerical Analysis
inferredcites →https://doi.org/10.1145/1346330.1346336openalex-snapshot
Minimum-weight triangulation is NP-hard
inferredcites →https://doi.org/10.1145/321941.321944openalex-snapshot
Fast Multiple-Precision Evaluation of Elementary Functions
inferredcites →https://doi.org/10.1145/800113.803626openalex-snapshot
Some NP-complete geometric problems
inferredcites →https://doi.org/10.4169/000298910x515785openalex-snapshot
Wronskians and Linear Independence

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_2openalex-snapshot
Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs
inferred← citeshttps://doi.org/10.1007/s00037-013-0079-3openalex-snapshot
Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy
inferred← citeshttps://doi.org/10.1007/s00224-012-9442-zopenalex-snapshot
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation
inferred← citeshttps://doi.org/10.1007/s00454-020-00232-wopenalex-snapshot
Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane
inferred← citeshttps://doi.org/10.1007/s10951-026-00879-yopenalex-snapshot
Launching drones from a vessel: routing unmanned aerial vehicles from a linearly moving depot
inferred← citeshttps://doi.org/10.1016/j.jsc.2020.04.013openalex-snapshot
Computing the multilinear factors of lacunary polynomials without heights
inferred← citeshttps://doi.org/10.1090/s0002-9947-2014-06268-5openalex-snapshot
Algebraic independence in positive characteristic: A 𝑝-adic calculus
inferred← citeshttps://doi.org/10.1109/access.2025.3606500openalex-snapshot
Efficient Top-k Content-Based Image Retrieval Exploiting Matrix Division Toward SIFT
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175707openalex-snapshot
Multiplicity Problems on Algebraic Series and Context-Free Grammars
inferred← citeshttps://doi.org/10.1109/tit.2026.3710290openalex-snapshot
Efficient ε -Approximate Minimum-Entropy Couplings
inferred← citeshttps://doi.org/10.1145/2465506.2465932openalex-snapshot
Factoring bivariate lacunary polynomials without heights
inferred← citeshttps://doi.org/10.1145/3274895.3274954openalex-snapshot
Sensible edge weight rounding for realistic path planning
inferred← citeshttps://doi.org/10.1145/3531130.3533331openalex-snapshot
Identity Testing for Radical Expressions
inferred← citeshttps://doi.org/10.1145/3597066.3597079openalex-snapshot
On the Order of Power Series and the Sum of Square Roots Problem
inferred← citeshttps://doi.org/10.1609/socs.v7i1.18389openalex-snapshot
Consistent Rounding of Edge Weights in Graphs
inferred← citeshttps://doi.org/10.3233/com-220407openalex-snapshot
On the complexity of algebraic numbers, and the bit-complexity of straight-line programs
inferred← citeshttps://doi.org/10.48550/arxiv.1309.5668openalex-snapshot
Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order
inferred← citeshttps://doi.org/10.70675/6d6d43caz5529z49a5zada4z1791b21f2fb7openalex-snapshot
Zero problems in polynomial models
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.