scientific article; zbMATH DE number 7788370
From MaRDI portal
Publication:6147281
Cited in
(73)- High-order lifting for polynomial Sylvester matrices
- Shortest distances as enumeration problem
- Pattern masking for dictionary matching: theory and practice
- Curvature sets over persistence diagrams
- Bisimplicial separators
- On black-box verifiable outsourcing
- Generalizing Frobenius inversion to quaternion matrices
- Efficiently-verifiable strong uniquely solvable puzzles and matrix multiplication
- \((\min ,+)\) matrix and vector products for inputs decomposable into few monotone subsequences
- Solving systems of linear equations through zero forcing set
- A refined laser method and faster matrix multiplication
- A single exponential time algorithm for homogeneous regular sequence tests
- An algebraic attack on stream ciphers with application to nonlinear filter generators and WG-PRNG
- Efficient Kirszbraun extension with applications to regression
- Quantum positive matrix-positive matrix multiplication algorithm
- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products
- Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities
- The complexity of algebraic algorithms for LWE
- Robust singular value decomposition with application to video surveillance background modelling
- Complex matrix inversion via real matrix inversions
- A new fast root-finder for black box polynomials
- Solving norm equations in global function fields
- Algorithms for linearly recurrent sequences of truncated polynomials
- Computing characteristic polynomials of p-curvatures in average polynomial time
- Computing paths of large rank in planar frameworks deterministically
- AntiFactor is FPT parameterized by treewidth and list size (but counting is hard)
- Hardness of approximate diameter: now for undirected graphs
- Faster algorithms for dual-failure replacement paths
- It's hard to HAC average linkage!
- Best linear unbiased estimate from privatized contingency tables
- Stability in graphs with matroid constraints
- The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds
- Discreteness of asymptotic tensor ranks (extended abstract)
- Universal matrix sparsifiers and fast deterministic algorithms for linear algebra
- On matrix multiplication and polynomial identity testing
- Matrix multiplication verification using coding theory
- Matrix multiplication reductions
- Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. I: Algorithmic results
- Symmetric powers: structure, smoothability, and applications
- Listing 4-cycles
- Bounded simultaneous messages
- Anti-factor is FPT parameterized by treewidth and list size (but counting is hard)
- Parameterized local search for vertex cover: when only the search radius is crucial
- Computing generalized convolutions faster than brute force
- Obstructions to faster diameter computation: asteroidal sets
- Faster path queries in colored trees via sparse matrix multiplication and min-plus product
- Fast computation of zigzag persistence
- Tight bounds for chordal/interval vertex deletion parameterized by treewidth
- Correction of ‘ J. Laderman, V. Pan, X.–H. Sha, On practical Algorithms for Accelerated Matrix Multiplication, Linear Algebra and its Applications. Vol. 162-164 (1992) pp. 557-588 ’
- (, +) matrix and vector products for inputs decomposable into few monotone subsequences
- Barriers for rectangular matrix multiplication
- The complexity of transitively orienting temporal graphs
- An improved algorithm for the k-Dyck edit distance problem
- On the external validity of average-case analyses of graph algorithms
- Faster modular composition
- Embedding integer lattices as ideals into polynomial rings
- Computing zigzag persistence on graphs in near-linear time
- Distributed subgraph finding: progress and challenges (invited talk)
- Algorithms, reductions and equivalences for small weight variants of all-pairs shortest paths
- Faster algorithms for rooted connectivity in directed graphs
- Faster monotone min-plus product, range mode, and single source replacement paths
- Constructing a distance sensitivity oracle in \(O(n^{2.5794}M)\) time
- Near optimal dual fault tolerant distance oracle
- Removing the log factor from (,+)-products on bounded range integer matrices
- Alternative basis matrix multiplication is fast and \(\mathrm{stable}^\dag\)
- Multiplication in finite fields with Chudnovsky-type algorithms over the projective line
- Explicit Riemann-Roch spaces in the Hilbert class field
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Matrix multiplication in the MPC model
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6147281)
