On the public citation graph

Upper bounds on the complexity of solving systems of linear equations

https://doi.org/10.1007/bf02104747
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/3-540-10856-4_79openalex-snapshot
Fast parallel computation of polynomials using few processors
inferredcites →https://doi.org/10.1007/bf01068849openalex-snapshot
Parallel computations in linear algebra
inferredcites →https://doi.org/10.1007/bf02163269openalex-snapshot
Numerical solution of linear equations with Toeplitz and Vector Toeplitz matrices
inferredcites →https://doi.org/10.1016/0020-0190(78)90079-0openalex-snapshot
An improved parallel processor bound in fast matrix inversion
inferredcites →https://doi.org/10.1016/0020-0190(79)90113-3openalex-snapshot
O(n2.7799) complexity for n × n approximate matrix multiplication
inferredcites →https://doi.org/10.1016/0020-0190(80)90033-2openalex-snapshot
Computing multivariate polynomials in parallel
inferredcites →https://doi.org/10.1016/0304-3975(83)90110-xopenalex-snapshot
The complexity of partial derivatives
inferredcites →https://doi.org/10.1063/1.526133openalex-snapshot
An exact recursion for the composite nearest-neighbor degeneracy for a 2× N lattice space
inferredcites →https://doi.org/10.1070/rm1980v035n05abeh001965openalex-snapshot
ON FAST CALCULATIONS IN SOME PROBLEMS OF LINEAR ALGEBRA CONNECTED WITH TOEPLITZ AND HANKEL MATRICES
inferredcites →https://doi.org/10.1090/s0025-5718-1974-0331751-8openalex-snapshot
Triangular factorization and inversion by fast matrix multiplication
inferredcites →https://doi.org/10.1109/sfcs.1978.34openalex-snapshot
Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations
inferredcites →https://doi.org/10.1109/t-c.1975.224291openalex-snapshot
Time and Parallel Processor Bounds for Linear Recurrence Systems
inferredcites →https://doi.org/10.1109/tc.1980.1675634openalex-snapshot
A Computation Model of Parallel Solution of Linear Equations
inferredcites →https://doi.org/10.1137/0112045openalex-snapshot
An Algorithm for the Inversion of Finite Toeplitz Matrices
inferredcites →https://doi.org/10.1137/0205040openalex-snapshot
Fast Parallel Matrix Inversion Algorithms
inferredcites →https://doi.org/10.1137/0208010openalex-snapshot
On the Parallel Evaluation of Multivariate Polynomials
inferredcites →https://doi.org/10.1137/0210032openalex-snapshot
Partial and Total Matrix Multiplication
inferredcites →https://doi.org/10.1137/0211038openalex-snapshot
On the Asymptotic Complexity of Matrix Multiplication
inferredcites →https://doi.org/10.1137/0212043openalex-snapshot
Fast Parallel Computation of Polynomials Using Few Processors
inferredcites →https://doi.org/10.1137/0707049openalex-snapshot
On Direct Methods for Solving Poisson’s Equations
inferredcites →https://doi.org/10.1137/1020096openalex-snapshot
A Survey of Parallel Algorithms in Numerical Linear Algebra
inferredcites →https://doi.org/10.1145/321420.321434openalex-snapshot
Matrix Inversion Using Parallel Processing
inferredcites →https://doi.org/10.1145/321738.321741openalex-snapshot
An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
inferredcites →https://doi.org/10.2307/2003785openalex-snapshot
Computational Methods of Linear Algebra

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-319-89963-3_9openalex-snapshot
Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection
inferred← citeshttps://doi.org/10.1007/978-3-642-15769-1_26openalex-snapshot
Points-to Analysis as a System of Linear Equations
inferred← citeshttps://doi.org/10.1007/bf01137457openalex-snapshot
Rapid parallel calculation of degrees in a quotient ring of polynomials over a finite field
inferred← citeshttps://doi.org/10.1007/s00012-010-0087-yopenalex-snapshot
On groups of hypersubstitutions
inferred← citeshttps://doi.org/10.1007/s10009-019-00520-8openalex-snapshot
Approximate reduction of finite automata for high-speed network intrusion detection
inferred← citeshttps://doi.org/10.1109/dft.2015.7315151openalex-snapshot
Predictive LBIST model and partial ATPG for seed extraction
inferred← citeshttps://doi.org/10.1109/ictai.2017.00163openalex-snapshot
Acquiring Local Preferences of Weighted Partial MaxSAT
inferred← citeshttps://doi.org/10.1111/2041-210x.12684openalex-snapshot
Speeding up the simulation of population spread models
inferred← citeshttps://doi.org/10.1163/1569392053971505openalex-snapshot
A probabilistic algorithm for finding the term rank of non-negative matrices
inferred← citeshttps://doi.org/10.1515/1569392053971505openalex-snapshot
A probabilistic algorithm for finding the term rank of non-negative 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.