Pages that link to "Item:Q1097640"

The following pages link to A fast parallel algorithm to compute the rank of a matrix over an arbitrary field (Q1097640):

Displayed 47 items.

• The complexity of intersecting finite automata having few final states (Q347114) ‎ (← links)
• New approaches to multi-objective optimization (Q403670) ‎ (← links)
• Deformation techniques to solve generalised Pham systems (Q598226) ‎ (← links)
• On a generalization of Stickelberger's theorem (Q607067) ‎ (← links)
• Dynamic normal forms and dynamic characteristic polynomial (Q633626) ‎ (← links)
• Lower bounds for monotone span programs (Q677989) ‎ (← links)
• Decomposition of algebras over finite fields and number fields (Q685720) ‎ (← links)
• Parallel algorithms for matrix normal forms (Q803724) ‎ (← links)
• Parallelism and fast solution of linear systems (Q911213) ‎ (← links)
• On the complexity of counting components of algebraic varieties (Q1030247) ‎ (← links)
• Membership testing in commutative transformation semigroups (Q1108790) ‎ (← links)
• Parallel algorithms for solvable permutation groups (Q1111023) ‎ (← links)
• An \(NC^ 2\) algorithm for testing similarity of matrices (Q1116651) ‎ (← links)
• The complexity of circuit value and network stability (Q1190989) ‎ (← links)
• On the parallel complexity of the polynomial ideal membership problem (Q1271168) ‎ (← links)
• Sparse hard sets for P: Resolution of a conjecture of Hartmanis (Q1288202) ‎ (← links)
• An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs (Q1295548) ‎ (← links)
• The probabilistic method yields deterministic parallel algorithms (Q1342858) ‎ (← links)
• NC solving of a system of linear ordinary differential equations in several unknowns (Q1351699) ‎ (← links)
• The Projective Noether Maple Package: Computing the dimension of a projective variety (Q1587230) ‎ (← links)
• Polynomial bounds for invariant functions separating orbits (Q1758265) ‎ (← links)
• Randomization and the parallel solution of linear algebra problems (Q1905899) ‎ (← links)
• Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties (Q1928235) ‎ (← links)
• How strong is Nisan's pseudo-random generator? (Q1944139) ‎ (← links)
• On arithmetic branching programs (Q1961372) ‎ (← links)
• A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density (Q2052162) ‎ (← links)
• A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals (Q2229288) ‎ (← links)
• Finding cut-offs in leaderless rendez-vous protocols is easy (Q2233393) ‎ (← links)
• On the complexity of matrix rank and rigidity (Q2268340) ‎ (← links)
• A complexity theory of constructible functions and sheaves (Q2340508) ‎ (← links)
• On the efficiency of effective Nullstellensätze (Q2366723) ‎ (← links)
• Non-commutative Edmonds' problem and matrix semi-invariants (Q2410690) ‎ (← links)
• 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) (Q2509264) ‎ (← links)
• The enumerability of P collapses P to NC (Q2575747) ‎ (← links)
• Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases (Q2576217) ‎ (← links)
• Boolean circuits versus arithmetic circuits (Q2639101) ‎ (← links)
• Bounded Treewidth and Space-Efficient Linear Algebra (Q2948475) ‎ (← links)
• Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices (Q3802506) ‎ (← links)
• COMPUTING THE DIMENSION OF IDEALS IN GROUP ALGEBRAS, WITH AN APPLICATION TO CODING THEORY (Q5036051) ‎ (← links)
• Adventures in monotone complexity and TFNP (Q5090415) ‎ (← links)
• On the complexity of computing the greatest common divisor of several univariate polynomials (Q5096342) ‎ (← links)
• (Q5140848) ‎ (← links)
• Parallel output-sensitive algorithms for combinatorial and linear algebra problems (Q5943098) ‎ (← links)
• Squarefree decomposition of univariate polynomials depending on a parameter. Application to the integration of parametric rational functions (Q5945288) ‎ (← links)
• Generalization of the subset sum problem and cubic forms (Q6039136) ‎ (← links)
• Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy (Q6076175) ‎ (← links)
• ABE for circuits with constant-size secret keys and adaptive security (Q6114257) ‎ (← links)