On the public citation graph

Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic

https://doi.org/10.1007/bfb0028792
0 signed · 67 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.1016/0020-0190(80)90042-3openalex-snapshot
A note on the parallel complexity of computing the rank of order n matrices
inferredcites →https://doi.org/10.1016/0304-3975(83)90002-6openalex-snapshot
Definability and fast quantifier elimination in algebraically closed fields
inferredcites →https://doi.org/10.1016/s0019-9958(82)90766-5openalex-snapshot
Fast parallel matrix and GCD computations
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/0212043openalex-snapshot
Fast Parallel Computation of Polynomials Using Few Processors
inferredcites →https://doi.org/10.1145/800133.804339openalex-snapshot
Parallelism in random access machines

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.1999.1069openalex-snapshot
Processor Efficient Parallel Solution of Linear Systems of Equations
inferred← citeshttps://doi.org/10.1006/jcss.1998.1615openalex-snapshot
Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis
inferred← citeshttps://doi.org/10.1007/3-540-51083-4_54openalex-snapshot
Some new effectivity bounds in computational geometry
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_160openalex-snapshot
Improved parallel computations with matrices and polynomials
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_90openalex-snapshot
Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_167openalex-snapshot
Verifying the determinant in parallel
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_26openalex-snapshot
On the existence of hard sparse sets under weak reductions
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_3openalex-snapshot
Sparse Sets versus Complexity Classes
inferred← citeshttps://doi.org/10.1007/978-3-540-75187-8_2openalex-snapshot
Computations in Modules over Commutative Domains
inferred← citeshttps://doi.org/10.1007/978-3-662-04166-6_48openalex-snapshot
Effective Matrix Methods in Commutative Domains
inferred← citeshttps://doi.org/10.1007/bf01200406openalex-snapshot
Algorithmic aspects of Suslin's proof of Serre's conjecture
inferred← citeshttps://doi.org/10.1007/bfb0016236openalex-snapshot
Parallel arithmetic computations: A survey
inferred← citeshttps://doi.org/10.1007/bfb0054375openalex-snapshot
Determinant: Old algorithms, new insights
inferred← citeshttps://doi.org/10.1007/pl00001596openalex-snapshot
Verifying the determinant in parallel
inferred← citeshttps://doi.org/10.1007/s00037-004-0182-6openalex-snapshot
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1007/s00037-021-00215-0openalex-snapshot
Factorization of Polynomials Given by Arithmetic Branching Programs
inferred← citeshttps://doi.org/10.1007/s00200-004-0158-4openalex-snapshot
Various New Expressions for Subresultants and Their Applications
inferred← citeshttps://doi.org/10.1007/s002090100287openalex-snapshot
The complexification and degree of a semi-algebraic set
inferred← citeshttps://doi.org/10.1007/s10208-002-0076-4openalex-snapshot
Vandermonde Matrices, NP-Completeness, and Transversal Subspaces
inferred← citeshttps://doi.org/10.1016/0022-4049(90)90159-fopenalex-snapshot
Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields
inferred← citeshttps://doi.org/10.1016/0167-8655(93)90148-7openalex-snapshot
Parallel computation of the Euler number via Connectivity Graph
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90102-3openalex-snapshot
Oracle computations in parallel numerical linear algebra
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00159-xopenalex-snapshot
Complexity lower bounds for computation trees with elementary transcendental function gates
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00030-8openalex-snapshot
Parallel computation of polynomial GCD and some related parallel computations over abstract fields
inferred← citeshttps://doi.org/10.1016/0898-1221(92)90215-4openalex-snapshot
Parametrization of Newton's iteration for computations with structured matrices and applications
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50022-9openalex-snapshot
Parallel Algorithms for Shared-Memory Machines
inferred← citeshttps://doi.org/10.1016/j.laa.2008.03.014openalex-snapshot
On the construction of a family of transversal subspaces over finite fields
inferred← citeshttps://doi.org/10.1016/s0022-4049(98)00148-0openalex-snapshot
On the intrinsic complexity of the arithmetic Nullstellensatz
inferred← citeshttps://doi.org/10.1016/s0022-4049(99)00158-9openalex-snapshot
Efficient algorithms for computing the characteristic polynomial in a domain
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80063-9openalex-snapshot
Feasible arithmetic computations: Valiant's hypothesis
inferred← citeshttps://doi.org/10.1080/00207160412331284178openalex-snapshot
Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267779openalex-snapshot
Processor-efficient parallel solution of linear systems. II. The positive characteristic and singular cases
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365736openalex-snapshot
Complexity lower bounds for computation trees with elementary transcendental function gates
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492492openalex-snapshot
The resolution of a Hartmanis conjecture
inferred← citeshttps://doi.org/10.1109/spdp.1991.218278openalex-snapshot
Efficient parallel independent subsets and matrix factorizations
inferred← citeshttps://doi.org/10.1134/s0361768823020160openalex-snapshot
Effective Lower Bounds on the Matrix Rank and Their Applications
inferred← citeshttps://doi.org/10.1134/s0361768824020142openalex-snapshot
Lower Bounds for the Rank of a Matrix with Zeros and Ones outside the Leading Diagonal
inferred← citeshttps://doi.org/10.1134/s0965542523010116openalex-snapshot
Generalization of the Subset Sum Problem and Cubic Forms
inferred← citeshttps://doi.org/10.1137/0224051openalex-snapshot
Work-Preserving Speed-Up of Parallel Matrix Computations
inferred← citeshttps://doi.org/10.1137/s0097539797349959openalex-snapshot
Parallel Complexity of Computations with General and Toeplitz-Like Matrices Filled with Integers and Extensions
inferred← citeshttps://doi.org/10.1145/113379.113396openalex-snapshot
Processor efficient parallel solution of linear systems over an abstract field
inferred← citeshttps://doi.org/10.1145/1390768.1390790openalex-snapshot
Expressing a fraction of two determinants as a determinant
inferred← citeshttps://doi.org/10.1145/140901.141926openalex-snapshot
Supereffective slow-down of parallel computations
inferred← citeshttps://doi.org/10.1145/143242.143350openalex-snapshot
On computing determinants of matrices without divisions
inferred← citeshttps://doi.org/10.1145/195058.195418openalex-snapshot
Lower bounds on testing membership to a polyhedron by algebraic decision trees
inferred← citeshttps://doi.org/10.1145/236869.236891openalex-snapshot
Computing the complexification of a semi-algebraic set
inferred← citeshttps://doi.org/10.1145/3087604.3087640openalex-snapshot
Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits
inferred← citeshttps://doi.org/10.1145/780542.780595openalex-snapshot
Derandomizing polynomial identity tests means proving circuit lower bounds
inferred← citeshttps://doi.org/10.1145/96877.96909openalex-snapshot
Arithmetic with real algebraic numbers is in NC
inferred← citeshttps://doi.org/10.1561/9781601984814openalex-snapshot
Partial Derivatives in Arithmetic Complexity and Beyond
inferred← citeshttps://doi.org/10.18452/16335openalex-snapshot
The structure of graphs and new logics for the characterization of Polynomial Time
inferred← citeshttps://doi.org/10.31857/s0044466923010118openalex-snapshot
Generalization of the Subset Sum Problem and Cubic Forms
inferred← citeshttps://doi.org/10.31857/s0132347423020176openalex-snapshot
Effective Lower Bounds on the Matrix Rank and Their Applications
inferred← citeshttps://doi.org/10.31857/s0132347424020133openalex-snapshot
Lower bounds for the rank of a matrix with zeros and ones outside the leading diagonal
inferred← citeshttps://doi.org/10.4086/cjtcs.1997.005openalex-snapshot
inferred← citeshttps://doi.org/10.4213/dm1128openalex-snapshot
О вычислении характеристического полинома матрицы
inferred← citeshttps://doi.org/10.48550/arxiv.1904.03950openalex-snapshot
From independent sets and vertex colorings to isotropic spaces and isotropic decompositions
inferred← citeshttps://doi.org/10.5555/314161.314429openalex-snapshot
A combinatorial algorithm for the determinant
inferred← citeshttps://doi.org/10.7146/dpb.v20i358.7955openalex-snapshot
Parallel Construction of Irreducible Polynomials
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.