Pages that link to "Item:Q2536323"

The following pages link to Gaussian elimination is not optimal (Q2536323):

Displaying 50 items.

• On computational complexity of Clifford algebra (Q3565282) (← links)
• Fast Generalized Bruhat Decomposition (Q3589076) (← links)
• Mutually Clock-Controlled Feedback Shift Registers Provide Resistance to Algebraic Attacks (Q3600335) (← links)
• A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities (Q3730348) (← links)
• Some independence results in complexity theory^† (Q3751002) (← links)
• General polynomial roots and their multiplicities in<i>O</i>(<i>N</i>)memory and<i>O</i>(<i>N</i>²)Time^∗ (Q3836210) (← links)
• The inversion of the discrete gauss transform (Q3899389) (← links)
• Some basic information on information-based complexity theory (Q3992023) (← links)
• Applications of graph theory in computer systems (Q4079059) (← links)
• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications (Q4085178) (← links)
• An extended duality theorem and multiplication of several matrices (Q4100216) (← links)
• On efficiently computing the product of two binary relations (Q4109192) (← links)
• Reduktion von Präzedenzstrukturen (Q4111262) (← links)
• Computational complexity of operations involving perfect elimination sparse matrices (Q4120049) (← links)
• Pyramids: A data type for matrix representation in Pascal (Q4142621) (← links)
• The adjacency relation on the traveling salesman polytope is NP-Complete (Q4153924) (← links)
• Characterizations of sums of dyads and of Kronecker products (Q4175698) (← links)
• A recursive partitioning algorithm for matrix inversion on parallel computers (Q4269907) (← links)
• Triangular Factorization and Inversion by Fast Matrix Multiplication (Q4402461) (← links)
• <i>N</i> latency 2<i>N</i> I/O‐bandwidth 2D‐array matrix multiplication algorithm (Q4542827) (← links)
• Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)
• (Q4558182) (← links)
• New applications of the polynomial method: The cap set conjecture and beyond (Q4562036) (← links)
• If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
• A Superquadratic Variant of Newton's Method (Q4594908) (← links)
• Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
• The border support rank of two-by-two matrix multiplication is seven (Q4615808) (← links)
• (Q4637752) (← links)
• (Q4638074) (← links)
• On optimizing multiplications of sparse matrices (Q4645925) (← links)
• POWER CIRCUITS, EXPONENTIAL ALGEBRA, AND TIME COMPLEXITY (Q4649509) (← links)
• Communication lower bounds and optimal algorithms for numerical linear algebra (Q4683913) (← links)
• Numerical tensor calculus (Q4683918) (← links)
• Stand-alone results and applications in multilinear algebra (Q4748296) (← links)
• Emmerald: a fast matrix–matrix multiply using Intel's SSE instructions (Q4790974) (← links)
• ENTROPY OF ALGORITHMS AND POTENTIAL PARALLELISM (Q4820012) (← links)
• FAST MATRIX MULTIPLICATION ALGORITHMS ON MIMD ARCHITECTURES (Q4820033) (← links)
• A RECURRENCE-FREE VARIANT OF STRASSEN'S ALGORITHM ON HYPERCUBE∗ (Q4820083) (← links)
• On the Geometry of Border Rank Algorithms for <i><i>n</i> × 2</i> by <i>2 × 2</i> Matrix Multiplication (Q4976181) (← links)
• Border Rank Nonadditivity for Higher Order Tensors (Q4986826) (← links)
• Further Limitations of the Known Approaches for Matrix Multiplication (Q4993288) (← links)
• A Computational Approach to First Passage Problems of Reflected Hyperexponential Jump Diffusion Processes (Q4995066) (← links)
• On the tensor rank of $3\times 3$ permanent and determinant (Q5003343) (← links)
• Tensor Rank is Hard to Approximate (Q5009520) (← links)
• (Q5009621) (← links)
• From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
• Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition (Q5009907) (← links)
• Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication (Q5020726) (← links)
• Universal points in the asymptotic spectrum of tensors (Q5039465) (← links)
• On computation of the Bessel function by summing up the series (Q5043040) (← links)