Q5090377 (Q5090377): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.ITCS.2019.7 / rank
Normal rank
 
Property / cites work
 
Property / cites work: If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a model for backtracking and dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced families of perfect hash functions and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and counting given length cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computation and the Evaluation of Tensor Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of tensor circuit evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the determinant in small parallel time using a small number of processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Travelling Salesman Problem in Bounded Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Paths and Packings in Halves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning via Inclusion-Exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms on Branch and Clique Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangular Factorization and Inversion by Fast Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complete Dichotomy Rises from the Capture of Vanishing Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Holant Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The arithmetic complexity of tensor contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Machine Calculation of Complex Fourier Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms are a good basis for counting small subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of tensor calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models of greedy algorithms for graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting \(H-\)colorings of partial \(k-\)trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Fast Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of fixed parameter clique and dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting and Counting Small Pattern Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for finding and counting subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Minimum Circuit in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Subquadratic Algorithm for Finding Outlier Correlations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and counting small induced subgraphs efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Decompositions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3655273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: INVOLUTORY HOPF ALGEBRAS AND 3-MANIFOLD INVARIANTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geometry of tensor network states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of tensors and fast matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Size of Semidefinite Programming Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical introduction to tensor networks: Matrix product states and projected entangled pair states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor-Rank and Lower Bounds for Arithmetic Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagrams, tensors and geometric reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality of graphical models and tensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On traces of tensor representations of diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding, Minimizing, and Counting Weighted Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for optimal 2-constraint satisfaction and its implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster all-pairs shortest paths via circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Four-Node Subgraphs in Triangle Time / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.ITCS.2019.7 / rank
 
Normal rank

Latest revision as of 15:53, 30 December 2024

scientific article; zbMATH DE number 7559050
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7559050

    Statements

    0 references
    0 references
    0 references
    18 July 2022
    0 references
    arithmetic complexity
    0 references
    lower bound
    0 references
    multilinear map
    0 references
    tensor network
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers