On the public citation graph
Berechnungen in partiellen Algebren endlichen Typs
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.
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/978-1-4684-2001-2_5openalex-snapshot
Efficient Iterations for Algebraic Numbers
inferredcites →https://doi.org/10.1007/978-3-642-94694-3openalex-snapshot
Einführung in die Transzendenten Zahlen
inferredcites →https://doi.org/10.1016/s0022-0000(73)80043-1openalex-snapshot
Optimal algorithms for parallel polynomial evaluation
inferredcites →https://doi.org/10.1090/s0002-9947-1965-0170805-7openalex-snapshot
On the Computational Complexity of Algorithms
inferredcites →https://doi.org/10.1109/swat.1971.23openalex-snapshot
Optimal algorithms for parallel polynomial evaluation
inferredcites →https://doi.org/10.1145/800152.804902openalex-snapshot
A bound on the multiplication efficiency of iteration
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-07407-4_12openalex-snapshot
Obere und untere Schranke für die Komplexität von Booleschen Funktionen
inferred← citeshttps://doi.org/10.1007/3-540-07407-4_9openalex-snapshot
The complexity of negation-limited networks — A brief survey
inferred← citeshttps://doi.org/10.1007/3-540-18740-5_33openalex-snapshot
On the complexity of approximate realization of continuous functions by schemes and formulas in continuous bases
inferred← citeshttps://doi.org/10.1007/bf01436566openalex-snapshot
Die Berechnungskomplexit�t von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
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/s10958-018-3928-4openalex-snapshot
On Bellman’s and Knuth’s Problems and their Generalizations
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/0771-050x(75)90005-4openalex-snapshot
A survey of techniques in applied computational complexity
inferred← citeshttps://doi.org/10.1070/sm2012v203n10abeh004270openalex-snapshot
A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials
inferred← citeshttps://doi.org/10.1145/3460952openalex-snapshot
On Computing Multilinear Polynomials Using Multi- r -ic Depth Four Circuits
inferred← citeshttps://doi.org/10.1515/9783112720875openalex-snapshot
A Model Theoretic Oriented Approach to Partial Algebras
inferred← citeshttps://doi.org/10.20948/mvk-2022-119openalex-snapshot
Bellman's, Knut's, Lupanov's, Pippenger's problems and their variations as generalizations of the addition chain problem
inferred← citeshttps://doi.org/10.3103/s0027132216020029openalex-snapshot
Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits
inferred← citeshttps://doi.org/10.4213/sm7904openalex-snapshot
Об одном методе получения нижних оценок сложности монотонных арифметических схем, вычисляющих действительные многочлены
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.