scientific article; zbMATH DE number 7563818

DOI10.4086/toc.2022.v018a016OpenAlexW4285232242MaRDI QIDQ5093402

Per Austrin, Kaie Kubjas, Petteri Kaski

Publication date: 26 July 2022

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2022.v018a016

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

lower boundarithmetic complexitytensor networkmultilinear map

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Multilinear algebra, tensor calculus (15A69) Theory of computing (68Qxx)

Cites Work

• A new algorithm for optimal 2-constraint satisfaction and its implications
• Graphical Models, Exponential Families, and Variational Inference
• Faster All-Pairs Shortest Paths via Circuit Complexity

This page was built for publication: