On the public citation graph

Square rooting is as difficult as multiplication

https://doi.org/10.1007/bf02253055
0 signed · 24 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-3-322-92149-9openalex-snapshot
Arithmetik in Rechenanlagen
inferredcites →https://doi.org/10.1109/tc.1972.5009039openalex-snapshot
Some Properties of Iterative Square-Rooting Methods Using High-Speed Multiplication
inferredcites →https://doi.org/10.1137/0201012openalex-snapshot
Computational Complexity of Iterative Processes

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-10003-2_57openalex-snapshot
Functions equivalent to integer multiplication
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_28openalex-snapshot
Fast Computations of the Exponential Function
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_48openalex-snapshot
Seventeen Lines and One-Hundred-and-One Points
inferred← citeshttps://doi.org/10.1007/bfb0043450openalex-snapshot
Hardware algorithms for VLSI systems
inferred← citeshttps://doi.org/10.1007/s11128-025-05008-wopenalex-snapshot
Computing $$\varphi (N)$$ for an RSA module with a single quantum query
inferred← citeshttps://doi.org/10.1016/0167-9260(84)90020-8openalex-snapshot
AT2-optimal VLSI integer division and integer square rooting
inferred← citeshttps://doi.org/10.1016/j.adhoc.2015.05.003openalex-snapshot
A modified Manhattan distance with application for localization algorithms in ad-hoc WSNs
inferred← citeshttps://doi.org/10.1016/j.patcog.2015.08.021openalex-snapshot
A computationally efficient scheme for feature extraction with kernel discriminant analysis
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.04.006openalex-snapshot
Seventeen lines and one-hundred-and-one points
inferred← citeshttps://doi.org/10.1090/s0025-5718-1984-0726007-1openalex-snapshot
Divisors in Residue Classes
inferred← citeshttps://doi.org/10.1109/icc45041.2023.10279477openalex-snapshot
Channel Charting: Model-Based Approaches
inferred← citeshttps://doi.org/10.1109/milcom.2016.7795510openalex-snapshot
A polynomial rooting based ML CFO estimator in multipath channel with repetitive pilot symbols
inferred← citeshttps://doi.org/10.1109/spcom.2016.7746618openalex-snapshot
Natural gradient non-parametric maximum likelihood algorithm for sparse channel estimation in non-Gaussian noise
inferred← citeshttps://doi.org/10.1109/tcomm.2023.3329522openalex-snapshot
Model-Based Approaches to Channel Charting
inferred← citeshttps://doi.org/10.1109/tnnls.2012.2194793openalex-snapshot
Complexity-Reduced Scheme for Feature Extraction With Linear Discriminant Analysis
inferred← citeshttps://doi.org/10.1142/s0219198922500177openalex-snapshot
Rank Reduction in Bimatrix Games
inferred← citeshttps://doi.org/10.1145/42282.214084openalex-snapshot
Comparing the combinational complexities of arithmetic functions
inferred← citeshttps://doi.org/10.17863/cam.63563openalex-snapshot
Uncomputability of phase diagrams
inferred← citeshttps://doi.org/10.23638/lmcs-13(2:13)2017openalex-snapshot
On-the-Fly Computation of Bisimilarity Distances
inferred← citeshttps://doi.org/10.48550/arxiv.1904.04251openalex-snapshot
A Manifold of Polynomial Time Solvable Bimatrix Games
inferred← citeshttps://doi.org/10.5802/ccirm.9openalex-snapshot
Algorithmes rapides pour les polynômes, séries formelles et 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.