On the public citation graph
Berechnung und programm. I
0 signed · 57 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/cpa.3160230204openalex-snapshot
On the number of multiplications necessary to compute certain functions
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_1openalex-snapshot
Evaluation of Rational Functions
inferredcites →https://doi.org/10.1007/bf01359700openalex-snapshot
Gleichungsdefinierbare Klassen partieller Algebren
inferredcites →https://doi.org/10.1007/bf01436566openalex-snapshot
Die Berechnungskomplexit�t von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
inferredcites →https://doi.org/10.1007/bf02252909openalex-snapshot
Berechnungen in partiellen Algebren endlichen Typs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jsco.2000.0369openalex-snapshot
The Projective Noether Maple Package: Computing the Dimension of a Projective Variety
inferred← citeshttps://doi.org/10.1007/3-540-06841-4_77openalex-snapshot
Komplexitätsmaße for Ausdrocke
inferred← citeshttps://doi.org/10.1007/3-540-08138-0_33openalex-snapshot
Über die Länge einer Berechnung bei linearer Parameterabhängigkeit der Operationszeit
inferred← citeshttps://doi.org/10.1007/3-540-08921-7_72openalex-snapshot
Multiplicative complexity of a pair of bilinear forms and of the polynomial multiplication
inferred← citeshttps://doi.org/10.1007/3-540-45410-1_12openalex-snapshot
Decision Complexity in Dynamic Geometry
inferred← citeshttps://doi.org/10.1007/3-540-60114-7_27openalex-snapshot
Integration of multivariate rational functions given by straight-line programs
inferred← citeshttps://doi.org/10.1007/3-540-60114-7_4openalex-snapshot
How lower and upper complexity bounds meet in elimination theory
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_58openalex-snapshot
Arithmetic Circuits for Discrete Logarithms
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_12openalex-snapshot
Determinantal Complexities and Field Extensions
inferred← citeshttps://doi.org/10.1007/bf01200407openalex-snapshot
On the efficiency of effective Nullstellens�tze
inferred← citeshttps://doi.org/10.1007/bf01272076openalex-snapshot
Fast exponentiation using the truncation operation
inferred← citeshttps://doi.org/10.1007/bf01272518openalex-snapshot
Some computational problems in linear algebra as hard as matrix multiplication
inferred← citeshttps://doi.org/10.1007/bf01436566openalex-snapshot
Die Berechnungskomplexit�t von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
inferred← citeshttps://doi.org/10.1007/bf01693976openalex-snapshot
Application of separability and independence notions for proving lower bounds of circuit complexity
inferred← citeshttps://doi.org/10.1007/bf02246615openalex-snapshot
Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen
inferred← citeshttps://doi.org/10.1007/bf02252909openalex-snapshot
Berechnungen in partiellen Algebren endlichen Typs
inferred← citeshttps://doi.org/10.1007/bfb0035783openalex-snapshot
Lower bounds for computations with the floor operation
inferred← citeshttps://doi.org/10.1016/0022-0000(85)90043-1openalex-snapshot
Irreducibility of multivariate polynomials
inferred← citeshttps://doi.org/10.1016/0022-4049(92)90059-oopenalex-snapshot
Verification complexity of linear prime ideals
inferred← citeshttps://doi.org/10.1016/0022-4049(95)00105-0openalex-snapshot
Semi-algebraic decision complexity, the real spectrum, and degree
inferred← citeshttps://doi.org/10.1016/0024-3795(77)90069-6openalex-snapshot
Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
inferred← citeshttps://doi.org/10.1016/0024-3795(78)90005-8openalex-snapshot
Some elementary proofs of lower bounds in complexity theory
inferred← citeshttps://doi.org/10.1016/0304-3975(75)90010-9openalex-snapshot
Die berechnungskomplexität der symbolischen differentiation von interpolationspolynomen
inferred← citeshttps://doi.org/10.1016/0304-3975(76)90089-xopenalex-snapshot
Realizing Boolean functions on disjoint sets of variables
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90110-xopenalex-snapshot
The complexity of partial derivatives
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90049-0openalex-snapshot
Fast algorithms for the characteristics polynomial
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90093-5openalex-snapshot
On the representation of rational functions of bounded complexity
inferred← citeshttps://doi.org/10.1016/0771-050x(75)90005-4openalex-snapshot
A survey of techniques in applied computational complexity
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90078-gopenalex-snapshot
Boolean circuits versus arithmetic circuits
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00126-9openalex-snapshot
A tight bound for approximating the square root
inferred← citeshttps://doi.org/10.1016/s0022-4049(97)00068-6openalex-snapshot
An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
inferred← citeshttps://doi.org/10.1016/s0378-4754(96)00017-1openalex-snapshot
Complexity bounds in elimination theory — A survey
inferred← citeshttps://doi.org/10.1109/18.567667openalex-snapshot
Factoring polynomials using binary representations of finite fields
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21921openalex-snapshot
Lower bounds for integer greatest common divisor computations
inferred← citeshttps://doi.org/10.1137/0205027openalex-snapshot
Computational Complexity over Finite Fields
inferred← citeshttps://doi.org/10.1137/0206030openalex-snapshot
A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions
inferred← citeshttps://doi.org/10.1137/0212001openalex-snapshot
The Computational Complexity of Continued Fractions
inferred← citeshttps://doi.org/10.1137/0216023openalex-snapshot
The Computational Complexity of Division in Quadratic Extension Fields
inferred← citeshttps://doi.org/10.1137/0220020openalex-snapshot
Lower Bounds for Computations with the Floor Operation
inferred← citeshttps://doi.org/10.1145/103516.103522openalex-snapshot
A lower bound for integer greatest common divisor computations
inferred← citeshttps://doi.org/10.1145/1086837.1086839openalex-snapshot
Toward a formal implementation of computer algebra
inferred← citeshttps://doi.org/10.1145/2422.322412openalex-snapshot
Bounding Fan-out in Logical Networks
inferred← citeshttps://doi.org/10.1145/276698.276856openalex-snapshot
Checking polynomial identities over any field
inferred← citeshttps://doi.org/10.1145/28395.28443openalex-snapshot
Single-factor Hensel lifting and its application to the straight-line complexity of certain polynomials
inferred← citeshttps://doi.org/10.1145/345542.345633openalex-snapshot
Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
inferred← citeshttps://doi.org/10.1145/42267.45069openalex-snapshot
Greatest common divisors of polynomials given by straight-line programs
inferred← citeshttps://doi.org/10.1145/800116.803750openalex-snapshot
A 2.5 n-lower bound on the combinational complexity of Boolean functions
inferred← citeshttps://doi.org/10.5802/xups.1997-01openalex-snapshot
Bases standard, élimination et complexité
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.