A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
From MaRDI portal
Publication:1097640
DOI10.1007/BF02579205zbMath0635.65040OpenAlexW2610884651MaRDI QIDQ1097640
Publication date: 1987
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579205
Related Items
COMPUTING THE DIMENSION OF IDEALS IN GROUP ALGEBRAS, WITH AN APPLICATION TO CODING THEORY, On the efficiency of effective Nullstellensätze, The probabilistic method yields deterministic parallel algorithms, NC solving of a system of linear ordinary differential equations in several unknowns, Boolean circuits versus arithmetic circuits, Randomization and the parallel solution of linear algebra problems, Membership testing in commutative transformation semigroups, Parallel algorithms for solvable permutation groups, The complexity of intersecting finite automata having few final states, An \(NC^ 2\) algorithm for testing similarity of matrices, Deformation techniques to solve generalised Pham systems, On a generalization of Stickelberger's theorem, Non-commutative Edmonds' problem and matrix semi-invariants, Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties, On the complexity of computing the greatest common divisor of several univariate polynomials, Bounded Treewidth and Space-Efficient Linear Algebra, Generalization of the subset sum problem and cubic forms, New approaches to multi-objective optimization, Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy, ABE for circuits with constant-size secret keys and adaptive security, How strong is Nisan's pseudo-random generator?, Dynamic normal forms and dynamic characteristic polynomial, Parallelism and fast solution of linear systems, On arithmetic branching programs, Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices, A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals, Finding cut-offs in leaderless rendez-vous protocols is easy, The complexity of circuit value and network stability, Lower bounds for monotone span programs, Decomposition of algebras over finite fields and number fields, Polynomial bounds for invariant functions separating orbits, Parallel output-sensitive algorithms for combinatorial and linear algebra problems, On the complexity of matrix rank and rigidity, Squarefree decomposition of univariate polynomials depending on a parameter. Application to the integration of parametric rational functions, Finite type projective modules, crossed linear maps and generalized inverses. (Modules projectifs de type fini, applications linéaires croisées et inverses généralisés), A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density, Adventures in monotone complexity and TFNP, On the parallel complexity of the polynomial ideal membership problem, On the complexity of counting components of algebraic varieties, Unnamed Item, Sparse hard sets for P: Resolution of a conjecture of Hartmanis, An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs, The Projective Noether Maple Package: Computing the dimension of a projective variety, The enumerability of P collapses P to NC, Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases, A complexity theory of constructible functions and sheaves, Parallel algorithms for matrix normal forms
Cites Work
