Gaussian elimination is not optimal
From MaRDI portal
Publication:2536323
DOI10.1007/BF02165411zbMath0185.40101WikidataQ21694537 ScholiaQ21694537MaRDI QIDQ2536323
Publication date: 1969
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131927
Analysis of algorithms and problem complexity (68Q25) Complexity and performance of numerical algorithms (65Y20)
Related Items
Computing matrix-valued Nevanlinna-Pick interpolation, On the complexity of integer matrix multiplication, Fast operations on linearized polynomials and their applications in coding theory, Fast rectangular matrix multiplication and QR decomposition, On the exponent of all pairs shortest path problem, Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures, Using Strassen's matrix multiplication in high performance solution of linear systems, Rectangular matrix multiplication revisited, Parallel evaluation of arithmetic circuits, A non-commutative cryptosystem based on quaternion algebras, Why does deep and cheap learning work so well?, Variational Bayesian least squares: an application to brain-machine interface data, A note on counting independent terms in asymptotic expressions of computational complexity, On the complexity of the multiplication of matrices of small formats, Fast matrix multiplication by using color algebras, Postulation of general quintuple fat point schemes in \(\mathbb P^3\), On the complexity of computing bilinear forms with \(\{0,1\}\) constants, Extending the four Russians' bound to general matrix multiplication, Computational methods of linear algebra, On the control of structural models, Shortest-path problem is not harder than matrix multiplication, The tensor rank of tensor product of two three-qubit W states is eight, Tensor rank is not multiplicative under the tensor product, Clustering large attributed information networks: an efficient incremental computing approach, Complexity measures for matrix multiplication algorithms, Relations between exact and approximate bilinear algorithms. Applications, Accelerating Viterbi algorithm on graphics processing units, The bit-operation complexity of matrix multiplication and of all pair shortest path problem, The matrix capacity of a tensor, On the algorithmic complexity of associative algebras, New combinations of methods for the acceleration of matrix multiplication, Probabilistic algorithms and straight-line programs for some rank decision problems, Plethysm and fast matrix multiplication, Fast structured matrix computations: tensor rank and Cohn-Umans method, A fast algorithm for finding all shortest paths, Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication, A note on 'Is shortest path problem not harder than matrix multiplication?', Entropy controlled Laplacian regularization for least square regression, The computational complexity of a set of quadratic functions, Computing the sign or the value of the determinant of an integer matrix, a complexity survey., Efficient parallel algorithms for linear recurrence computation, Computing lower bounds on tensor rank over finite fields, Fast matrix multiplication without APA-algorithms, The complexity of partial derivatives, On the asymptotic complexity of rectangular matrix multiplication, A DEMATEL-based completion method for incomplete pairwise comparison matrix in AHP, Discrete convolution with modulo operations, An implicit algorithm for validated enclosures of the solutions to variational equations for ODEs, An ultrafast cellular method for matrix multiplication, On practical algorithms for accelerated matrix multiplication, Superfast algorithms for Cauchy-like matrix computations and extensions, Multilinear algebra and parallel programming, Inverse linear difference operators, Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth, Comparisons of Gaussian elimination algorithms on a Cray Y-MP, A lower bound for the multiplication of polynomials modulo a polynomial, A segregated approach for modeling the electrochemistry in the 3-D microstructure of li-ion batteries and its acceleration using block preconditioners, Memory-usage advantageous block recursive matrix inverse, Convolution accelerator designs using fast algorithms, An optimized differential step-size LMS algorithm, Essentially optimal computation of the inverse of generic polynomial matrices, Algebraic methods in the congested clique, An algorithm for testing chordality of graphs, Optimum computation of p bilinear forms, Beyond the Alder-Strassen bound., On a Newton-Moser type method, On the implementation of Strassen's fast multiplication algorithm, A survey of techniques in applied computational complexity, Untersuchungen des Zeitgewinns durch neue Algorithmen zur Matrix- Multiplikation, An algorithm for finding all shortest paths using \(N^{2\cdot 81}\) infinite-precision multiplications, Realizing Boolean functions on disjoint sets of variables, An algebraic approach for reasoning about information flow, The singularity attack to the multivariate signature scheme HIMQ-3, A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices, Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, The complexity of group algebra computations, Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25, Optimisation of complex integration contours at higher order, The Fast Fourier Transform by polynomial evaluation, A noncommutative algorithm for multiplying 5 X 5 matrices using 103 multiplications, Recognition of EOL languages in less than quartic time, A simple proof of Strassen's result, \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication, A fast algorithm for all-pairs Hamming distances, A fast recursive algorithm for multiplying matrices of order \(n = 3^q\) \((q > 1)\), Computing the depth distribution of a set of boxes, Determinisability of unary weighted automata over the rational numbers, Fast rectangular matrix multiplication and applications, A noncommutative algorithm for multiplying 5\(\times 5\) matrices using 102 multiplications, An efficient algorithm for deciding quadratic residuosity in finite fields \(GF(p^ m)\), Non-cancellative Boolean circuits: A generalization of monotone boolean circuits, A simple complexity proof for a polynomial-time linear programming algorithm, Randomised algorithms, Why does information-based complexity use the real number model?, Algorithms for exponentiation in finite fields, Algorithms for fast convolutions on motion groups, An optimum partition for inverting a nonsingular matrix, FFT-like multiplication of linear differential operators, Self-testing/correcting with applications to numerical problems, Distributional Robustness in Minimax Linear Quadratic Control with Wasserstein Distance, Universal points in the asymptotic spectrum of tensors, Emmerald: a fast matrix–matrix multiply using Intel's SSE instructions, On computation of the Bessel function by summing up the series, The quadratic hull of a code and the geometric view on multiplication algorithms, A recursive partitioning algorithm for matrix inversion on parallel computers, Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures, Fast Output-Sensitive Matrix Multiplication, N latency 2N I/O‐bandwidth 2D‐array matrix multiplication algorithm, Unnamed Item, The Subrank of a Complex Symmetric Tensor Can Exceed its Symmetric Subrank, Some basic information on information-based complexity theory, Faster All-Pairs Shortest Paths via Circuit Complexity, A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities, ENTROPY OF ALGORITHMS AND POTENTIAL PARALLELISM, FAST MATRIX MULTIPLICATION ALGORITHMS ON MIMD ARCHITECTURES, A RECURRENCE-FREE VARIANT OF STRASSEN'S ALGORITHM ON HYPERCUBE∗, New applications of the polynomial method: The cap set conjecture and beyond, If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser, Some independence results in complexity theory†, On the tensor rank of $3\times 3$ permanent and determinant, Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps, Unnamed Item, Unnamed Item, A decade of TAPSOFT, On the Geometry of Border Rank Decompositions for Matrix Multiplication and Other Tensors with Symmetry, On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms, Geometry and the complexity of matrix multiplication, Efficient Enumeration of Regular Languages, A Superquadratic Variant of Newton's Method, Hardness Results for Structured Linear Systems, Unnamed Item, Fast matrix multiplication and its algebraic neighbourhood, Efficient parallel and incremental parsing of practical context-free languages, Further Limitations of the Known Approaches for Matrix Multiplication, Deterministic methods to find primes, Derivation and Analysis of Fast Bilinear Algorithms for Convolution, Computational Complexity of SRIC and LRIC Indices, Applications of graph theory in computer systems, Constructing Maximal Subgroups of Classical Groups, A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications, COMPUTATION OF A DETERMINANT AND A MATRIX PRODUCT IN CELLULAR AUTOMATA, Tensor Rank is Hard to Approximate, An extended duality theorem and multiplication of several matrices, On optimizing multiplications of sparse matrices, Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions, On computational complexity of Clifford algebra, POWER CIRCUITS, EXPONENTIAL ALGEBRA, AND TIME COMPLEXITY, On efficiently computing the product of two binary relations, Transition Operator Approach to Seismic Full-Waveform Inversion in Arbitrary Anisotropic Elastic Media, Reduktion von Präzedenzstrukturen, A Rank 18 Waring Decomposition of sM〈3〉 with 432 Symmetries, Equations for Lower Bounds on Border Rank, General polynomial roots and their multiplicities inO(N)memory andO(N2)Time∗, Computational complexity of operations involving perfect elimination sparse matrices, Speedup of linear stationary iteration processes in multiprocessor computers. I, Asymptotic entanglement transformation between W and GHZ states, Strassen's Algorithm for Tensor Contraction, Fast Generalized Bruhat Decomposition, Pyramids: A data type for matrix representation in Pascal, Unnamed Item, Unnamed Item, Mutually Clock-Controlled Feedback Shift Registers Provide Resistance to Algebraic Attacks, Unnamed Item, The adjacency relation on the traveling salesman polytope is NP-Complete, Unnamed Item, Communication lower bounds and optimal algorithms for numerical linear algebra, Numerical tensor calculus, Unnamed Item, A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs, Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic, Characterizations of sums of dyads and of Kronecker products, On Strassen's Rank Additivity for Small Three-way Tensors, The border rank of the multiplication of $2\times 2$ matrices is seven, The border support rank of two-by-two matrix multiplication is seven, Modification Methods for Inverting Matrices and Solving Systems of Linear Algebraic Equations, Unnamed Item, The inversion of the discrete gauss transform, On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication, Limits on the Universal method for matrix multiplication, Lower Bounds for DeMorgan Circuits of Bounded Negation Width, The Geometry of Rank Decompositions of Matrix Multiplication I: 2 × 2 Matrices, An approach for computing the exact stability domain for a class of LTI parameter dependent systems, Barriers for fast matrix multiplication from irreversibility, Border Rank Nonadditivity for Higher Order Tensors, A hierarchical discretized-parameter polynomial adaptive estimator for non-linearly parameterized systems, A Computational Approach to First Passage Problems of Reflected Hyperexponential Jump Diffusion Processes, Computation of polarized metrized graph invariants by using discrete Laplacian matrix, On the reduction of total‐cost and average‐cost MDPs to discounted MDPs, Accelerated multiple precision matrix multiplication using Strassen's algorithm and Winograd's variant, Performance evaluation of multiple precision matrix multiplications using parallelized Strassen and Winograd algorithms, Two new algorithms for matrix multiplication and vector convolution, Stand-alone results and applications in multilinear algebra, Unnamed Item, From Circuit Complexity to Faster All-Pairs Shortest Paths, Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition, Unnamed Item, Unnamed Item, Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication, Triangular Factorization and Inversion by Fast Matrix Multiplication, Backfitting for large scale crossed random effects regressions, Cryptanalysis of the class of maximum period Galois NLFSR-based stream ciphers, On construction of efficient algorithms for solving systems of polynomial Boolean equations by testing a part of variables, Generation of test matrices with specified eigenvalues using floating-point arithmetic, Efficient transitive closure of sparse matrices over closed semirings, Maximum matchings in planar graphs via Gaussian elimination, Fast computation of the rank profile matrix and the generalized Bruhat decomposition, A survey of the all-pairs shortest paths problem and its variants in graphs, Gaussian elimination is not optimal, revisited, Supercomputer environment for recursive matrix algorithms, Valiant's holant theorem and matchgate tensors, The matrix reloaded: multiplication strategies in FrodoKEM, A report on the performance of an implementation of Strassen's algorithm, Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures, The shifted number system for fast linear algebra on integer matrices, Fast commutative matrix algorithms, External matrix multiplication and all-pairs shortest path, Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems, A toolkit for Parikh matrices, The \(G\)-stable rank for tensors and the cap set problem, McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD, Complexity bounds for approximately solving discounted MDPs by value iterations, List decoding of convolutional codes over integer residue rings, Geometric conditions for strict submultiplicativity of rank and border rank, Verified numerical computations for large-scale linear systems., An introduction to the computational complexity of matrix multiplication, The bilinear complexity and practical algorithms for matrix multiplication, Control of ellipsoidal trajectories: Theory and numerical results, Efficiently correcting matrix products, Time and space efficient generators for quasiseparable matrices, On the complexity of finding tensor ranks, Efficiently Correcting Matrix Products, Unnamed Item, Near Collision Attack on the Grain v1 Stream Cipher, Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science, Lower bounds for Boolean circuits of bounded negation width, Some fast algorithms multiplying a matrix by its adjoint, Efficient algorithm for proper orthogonal decomposition of block-structured adaptively refined numerical simulations, On the structure tensor of \(\mathfrak{sl}_n\), On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field, Error‐free transformation of matrix multiplication with a posteriori validation, Tensor surgery and tensor rank, Asymptotic tensor rank of graph tensors: beyond matrix multiplication, Rank-profile revealing Gaussian elimination and the CUP matrix decomposition, Guessing singular dependencies, HPMaX: heterogeneous parallel matrix multiplication using CPUs and GPUs, Bounded-rank tensors are defined in bounded degree, On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication, A note on the multiplication of sparse matrices, Counting points on hyperelliptic curves in average polynomial time, Scientific achievements of Anatolii Alekseevich Karatsuba, Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution, Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model, Fast hybrid matrix multiplication algorithms, On the choice of a multiplication algorithm for polynomials and polynomial matrices, Fast computation of special resultants, New ways to multiply \(3 \times 3\)-matrices, Trisymmetric multiplication formulae in finite fields, Fast linear algebra is stable, Erasure decoding of convolutional codes using first-order representations, Calculation of the characteristic polynomial of a matrix, Deterministic computation of the characteristic polynomial in the time of matrix multiplication, Fast Exact Algorithm for L(2,1)-Labeling of Graphs, Fast bilinear algorithms for symmetric tensor contractions, THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS, All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time, Model checking propositional dynamic logic with all extras, Improved method for finding optimal formulas for bilinear maps in a finite field, Strassen's \(2 \times 2\) matrix multiplication algorithm: a conceptual perspective, A new fast recursive matrix multiplication algorithm, Construction of the irreducible modular representations of a finite group, A faster algorithm for reducing the computational complexity of convolutional neural networks, Fast matrix decomposition in \(\mathbb F_2\), Sparse matrix multiplication and triangle listing in the congested clique model, Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity, Optimal fast Johnson-Lindenstrauss embeddings for large data sets, Rank and border rank of Kronecker powers of tensors and Strassen's laser method, $$P\mathop{ =}\limits^{?}NP$$, Improving the Numerical Stability of Fast Matrix Multiplication, Upgrading Subgroup Triple-Product-Property Triples, Practical complexities of probabilistic algorithms for solving Boolean polynomial systems, On the Differential and Full Algebraic Complexities of Operator Matrices Transformations, On Multiple Eigenvalues of a Matrix Dependent on a Parameter, Efficient determination of the transitive closure of a directed graph, On multiplication of 2 \(\times\) 2 matrices, Evaluating polynomials at many points, Sur le calcul des produits de matrices. (Calculation of the product of matrices.), On symmetries of tensor decompositions for the commutator of \(2 \times 2\) matrices, Tripartite Entanglement Transformations and Tensor Rank, Equivalent polyadic decompositions of matrix multiplication tensors, Unitäre Transformationen großer Matrizen, Degenerate Gaussian factors for probabilistic inference, Almost all subgeneric third-order Chow decompositions are identifiable, The inverse of \(\chi\) and its applications to Rasta-like ciphers, Grothendieck constant is norm of Strassen matrix multiplication tensor, Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures, Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case, A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices, A theoretical analysis of deep neural networks and parametric PDEs, On the effect of projection on rank attacks in multivariate cryptography, An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs, Gaussian elimination is optimal for solving linear equations in dimension two, Minimal fill in O(\(n^{2.69}\)) time, Fast algorithms for the basic operation of cellular methods of linear algebra, The Faddeev-LeVerrier algorithm and the Pfaffian, A polynomial time bound for Howard's policy improvement algorithm, A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic, Cancellation is exponentially powerful for computing the determinant, Speeding up HMM decoding and training by exploiting sequence repetitions, Parity OBDDs cannot be handled efficiently enough, An algebraic attack on the improved summation generator with 2-bit memory, On the nuclear norm and the singular value decomposition of tensors, A very personal reminiscence on the problem of computational complexity, Efficient enumeration of words in regular languages, Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank, A modified wright-Fisher model that incorporates \(N_e\): a variant of the standard model with increased biological realism and reduced computational complexity, On the computational complexity of the general discrete Fourier transform, Discrete logarithms in \(\mathrm{GF}(p)\), Fast verified solutions of linear systems, The trace invariant and matrix inversion, Ciphertext-only attack on \(d\times d\) Hill in \(O(d 13^d)\), On the arithmetic complexity of Strassen-like matrix multiplications, An improved parallel algorithm that computes the BFS numbering of a directed graph, On sunflowers and matrix multiplication, Generating fast Fourier transforms of solvable groups, The aggregation and cancellation techniques as a practical tool for faster matrix multiplication, Morse theory for filtrations and efficient computation of persistent homology, The complexity of computing the permanent, Algebraic attacks on a class of stream ciphers with unknown output function, The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms, Matrix structures in parallel matrix computations, Fast matrix multiplication is stable, The bulk-synchronous parallel random access machine, Parsing by matrix multiplication generalized to Boolean grammars, On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping, On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication, The rank of \(n \times n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\), Switching functions whose monotone complexity is nearly quadratic, Optimal sparse matrix dense vector multiplication in the I/O-model, Fast exact algorithm for \(L(2,1)\)-labeling of graphs, Optimal algorithms of Gram-Schmidt type, Conjunctive and Boolean grammars: the true general case of the context-free grammars, On groups of hypersubstitutions, On the arithmetic Walsh coefficients of Boolean functions, On the approximate bilinear complexity of matrix multiplication, Stability of fast algorithms for matrix multiplication, Bounds on the ranks of some 3-tensors, Negation can be exponentially powerful, Average-case complexity of the min-sum matrix product problem, Constructive homomorphisms for classical groups., Sets of nonnegative matrices without positive products, Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method, Parallelism and fast solution of linear systems, Replacing unification by constraint satisfaction to improve logic program expressiveness, Positivity preserving discretization of time dependent semiconductor drift-diffusion equations, A tensor product formulation of Strassen's matrix multiplication algorithm, New fast hybrid matrix multiplication algorithms, New cellular methods for matrix multiplication, A unified cellular method for matrix multiplication, An all-pairs shortest path algorithm for bipartite graphs, Finding large 3-free sets. I. The small \(n\) case, Two dimensional aggregation procedure: An alternative to the matrix algebraic algorithm, Computing the Fréchet distance between simple polygons, Comments to my works, written by myself, On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices, Neighborhood-based uncertainty generation in social networks, The Hackbusch conjecture on tensor formats, On the additive complexity of 2 \(\times 2\) matrix multiplication, A fast cellular method of matrix multiplication, The Fork95 programming language: Design, implementation, application., Optimal Karatsuba-like formulae for certain bilinear forms in GF(2), Numerical CP decomposition of some difficult tensors, The double pivot simplex method, Solving structured linear systems with large displacement rank, On minimum witnesses for Boolean matrix multiplication, Some computational problems in linear algebra as hard as matrix multiplication, Decision problem for shuffled genes, Fast multiplication of matrices over a finitely generated semiring, Optimization techniques for small matrix multiplication, Using Strassen's algorithm to accelerate the solution of linear systems, Bayesian robot system identification with input and output noise, The Mailman algorithm: a note on matrix-vector multiplication, Efficient algorithms for clique problems, Newton's method and FFT trading, Residual methods for the large-scale matrix \(p\)th root and some related problems, Solving path problems on the GPU, All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time, Information-based complexity: New questions for mathematicians, Generalized matrix inversion is not harder than matrix multiplication, A mixed cellular method of matrix multiplication, On-line computation of transitive closures of graphs, Multiplicative complexity and algebraic structure, A parallel search algorithm for directed acyclic graphs, Fast algorithms for the characteristic polynomial, The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations, Storing matrices on disk for efficient row and column retrieval, Improved lower bounds for some matrix multiplication problems, On transformations of algorithms to multiply 2\(\times 2\) matrices, Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés, On the complexity of skew arithmetic, Randomized numerical linear algebra: Foundations and algorithms, Tensors in computations, Skew-polynomial-sparse matrix multiplication, Combined invariant subspace \& frequency-domain subspace method for identification of discrete-time MIMO linear systems, Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation, Flip Graphs for Matrix Multiplication, The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\), Faster possibility detection by combining two approaches, Pebbling Game and Alternative Basis for High Performance Matrix Multiplication, A structure-preserving, upwind-SAV scheme for the degenerate Cahn-Hilliard equation with applications to simulating surface diffusion, An estimator for the hardness of the MQ problem, Testing indexability and computing Whittle and Gittins index in subcubic time, A normal form for matrix multiplication schemes, Improving support-minors rank attacks: applications to G\textit{e}MSS and Rainbow, A decoding algorithm for 2D convolutional codes over the erasure channel, Recursive cellular methods of matrix multiplication, Neural networks for scalar input and functional output, Computation of the commutator of 2 × 2 matrices via six multiplications, On the computation of general vector-valued modular forms, Bad and good news for Strassen's laser method: border rank of \(\mathrm{Perm}_3\) and strict submultiplicativity, Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato}, Reduced-order modeling of neutron transport eigenvalue problems separated in energy by proper generalized decomposition, Numerical stability and tensor nuclear norm, Irreversibility of structure tensors of modules, Algebraic attacks on Rasta and Dasta using low-degree equations, New lower bounds for matrix multiplication and, MR-DSS -- smaller MinRank-based (ring-)signatures, Statistical Analysis of Random Objects Via Metric Measure Laplacians, Verifying the product of generalized Boolean matrix multiplication and its applications to detect small subgraphs, Pointwise error estimates of numerical solutions to linear quadratic optimal control problems, Unnamed Item, Algorithms, Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\), An adaptive prefix-assignment technique for symmetry reduction, A fully dynamic algorithm for maintaining the transitive closure, Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
Cites Work
