%% Theory of Computing
%% File: v018a016.bib
%% Publication date: June 22, 2022
%% Authors: Per Austrin, Petteri Kaski, and Kaie Kubjas
%
%
%
%

#OK
@INPROCEEDINGS{AlmanVW2021,
author = {Alman, Josh and Vassilevska Williams, Virginia},
title = {A refined laser method and faster matrix multiplication},
crossref = {psoda21},
pages = {522-539},
doi = {10.1137/1.9781611976465.32},
eprint = {2010.05846},
}

#OK
%
@inproceedings{MoitraW2018,
author = {Moitra, Ankur and Wein, Alexander S.},
title = {Spectral Methods from Tensor Networks},
crossref = {pstoc19},
pages = {926--937},
doi = {10.1145/3313276.3316357},
eprint = {1811.00944},
}
%
@ARTICLE{MoitraW2018-orig,
author = {Ankur Moitra and Alexander S. Wein},
title     = {Spectral Methods from Tensor Networks},
journal   = {arXiv:1811.00944},
volume    = {},
year      = {2018},
url       = {http://arxiv.org/abs/1811.00944},
archivePrefix = {arXiv},
eprint    = {1811.00944},
}
%
@INPROCEEDINGS{MarkidisCLPV18,
author = {Markidis, Stefano and Chien, Steven Wei Der and Laure, Erwin and Peng, Ivy Bo and Vetter, Jeffrey S.},
title = {{NVIDIA} Tensor Core Programmability, Performance {\&} Precision},
crossref = {pIPDPS18},
pages = {522--531},
doi = {10.1109/IPDPSW.2018.00091},
eprint = {1803.04014},
}
%
@INPROCEEDINGS{JouppiYPPABBBBB17,
author = {Jouppi, Norman P. and Cliff Young and Nishant Patil and David Patterson +72},
title = {In-Datacenter Performance Analysis of a Tensor Processing Unit},
crossref = {pisca17},
pages = {1--12},
doi = {10.1145/3079856.3080246},
eprint = {1704.04760},
}


#OK
@INPROCEEDINGS{LincolnWW18,
author = {Lincoln, Andrea and Vassilevska Williams, Virginia and Williams, R. Ryan},
title = {Tight Hardness for Shortest Cycles and Paths in Sparse Graphs},
crossref = {psoda18},
pages = {1236--1252},
doi = {10.1137/1.9781611975031.80},
eprint = {1712.08147},
}

#OK
@INPROCEEDINGS{BodlaenderLRV2010,
author = {Bodlaender, Hans L. and Leeuwen, Erik Jan van and van Rooij, Johan M. M. and Vatshelle, Martin},
title = {Faster Algorithms on Branch and Clique Decompositions},
crossref = {pmfcs10},
pages = {174--185},
doi = {10.1007/978-3-642-15155-2\_17},
}


#OK
@INPROCEEDINGS{Dorn2006,
author    = {Dorn, Frederic},
title     = {Dynamic Programming and Fast Matrix Multiplication},
crossref = {pesa06},
pages     = {280--291},
doi       = {10.1007/11841036\_27},
}


#OK
@ARTICLE{DiazST02,
author = {D{\'{\i}}az, Josep and Serna, Maria J. and Thilikos, Dimitrios M.},
title = {Counting {$H$}-colorings of partial $k$-trees},
journal = tcs,
volume = {281},
number = {1--2},
pages = {291--309},
year = {2002},
doi = {10.1016/S0304-3975(02)00017-8},
note = {\prelim \href{https://doi.org/10.1007/3-540-44679-6\_33}{COCOON'01}}
}

#OK
@ARTICLE{RobertsonS1991,
title = {Graph minors. {X}. {O}bstructions to tree-decomposition},
author = {Robertson, Neil and Seymour, Paul D.},
journal = jctb,
volume = {52},
number = {2},
pages = {153--190},
year = {1991},
doi = {10.1016/0095-8956(91)90061-N},
}

#OK
@INPROCEEDINGS{Nisan91,
author = {Nisan, Noam},
title = {Lower Bounds for Non-Commutative Computation (Extended Abstract)},
crossref = {pstoc91},
pages = {410--418},
doi = {10.1145/103418.103462},
}

#OK
@ARTICLE{CichockiPZLOSM2017,
author = {Cichocki, Andrzej and Phan, Anh Huy and Zhao, Qibin and Lee, Namgil and Oseledets, Ivan V. and Sugiyama, Masashi and Mandic, Danilo P.},
title = {Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 2 {A}pplications and Future Perspectives},
journal = FoundTrendsML,
volume = {9},
number = {6},
pages = {431--673},
year = {2017},
doi = {10.1561/2200000067},
eprint = {1708.09165},
}

#OK
@ARTICLE{CichockiLOPZM2016,
author = {Cichocki, Andrzej and Lee, Namgil and Oseledets, Ivan V. and Phan, Anh Huy and Zhao, Qibin and Mandic, Danilo P.},
title = {Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 {L}ow-Rank Tensor Decompositions},
journal = FoundTrendsML,
volume = {9},
number = {4--5},
pages = {249--429},
year = {2016},
doi = {10.1561/2200000059},
}

#OK
@BOOK{AroraB2009,
author = {Arora, Sanjeev and Barak, Boaz},
title = {Computational Complexity: A Modern Approach},
year = {2009},
publisher = cup,
doi = {10.1017/CBO9780511804090},
}


#OK
@ARTICLE{Gasarch2012,
Author = {Gasarch, William I.},
Title = {The Second {P\,=?\,NP} Poll},
journal = sigactnews,
volume = {43},
number = {2},
Year = {2012},
pages = {53--77},
doi = {10.1145/2261417.2261434},
}

#OK
@ARTICLE{KarppaKK2018,
author = {Karppa, Matti and Kaski, Petteri and Kohonen, Jukka},
title = {A Faster Subquadratic Algorithm for Finding Outlier Correlations},
journal = talg,
volume = {14},
number = {3},
pages = {31:1--26},
year = {2018},
doi = {10.1145/3174804},
note = {\prelim \href{https://doi.org/10.1137/1.9781611974331.ch90}{SODA'16}},
eprint = {1510.03895},
}

#OK
@INPROCEEDINGS{BjorklundHKK2007,
author = {Bj{\"{o}}rklund, Andreas and Husfeldt, Thore and Kaski, Petteri and Koivisto, Mikko},
title = {Fourier meets {M}{\"{o}}bius: fast subset convolution},
crossref = {pstoc07},
pages = {67--74},
doi = {10.1145/1250790.1250801},
eprint = {cs/0611101},
}

#OK
@INPROCEEDINGS{LeeRS2015,
author = {Lee, James R. and Raghavendra, Prasad and Steurer, David},
title = {Lower Bounds on the Size of Semidefinite Programming Relaxations},
crossref = {pstoc15},
pages = {567--576},
doi = {10.1145/2746539.2746599},
eprint = {1411.6317},
}
%
@ARTICLE{DavisI2009,
author = {Davis, Sashka and Impagliazzo, Russell},
title = {Models of Greedy Algorithms for Graph Problems},
journal = Algorithmica,
volume = {54},
number = {3},
pages = {269--317},
year = {2009},
doi = {10.1007/s00453-007-9124-4},
note = {\prelim \href{https://dl.acm.org/doi/10.5555/982792.982847}{SODA'04}},
eprint = {eccc:TR05-120},
}

#OK
@ARTICLE{AlekhnovichBBIMP2011,
author = {Alekhnovich, Michael and Borodin, Allan and Buresh{-}Oppenheim, Joshua and Impagliazzo, Russell and Magen, Avner and Pitassi, Toniann},
title = {Toward a Model for Backtracking and Dynamic Programming},
journal = ccomplex,
volume = {20},
number = {4},
pages = {679--740},
year = {2011},
doi = {10.1007/s00037-011-0028-y},
note = {\prelim \href{https://doi.org/10.1109/CCC.2005.32}{CCC'05}},
eprint = {eccc:TR09-038},
}

#OK
@ARTICLE{Valiant1979,
author = {Valiant, Leslie G.},
title = {The complexity of computing the permanent},
journal = tcs,
volume = {8},
number = {2},
pages = {189--201},
year = {1979},
doi = {10.1016/0304-3975(79)90044-6},
}

#OK
@ARTICLE {CooleyT1965,
author = {Cooley, James W. and Tukey, John W.},
title = {An algorithm for the machine calculation of complex {F}ourier series},
journal = MathComp,
year = {1965},
volume = {19},
number = {90},
pages = {297--301},
doi = {10.1090/S0025-5718-1965-0178586-1},
}
%
@INPROCEEDINGS{Bjorklund2016,
author = {Bj{\"{o}}rklund, Andreas},
title = {Below All Subsets for Some Permutational Counting Problems},
crossref = {pswat16},
pages = {17:1--11},
doi = {10.4230/LIPIcs.SWAT.2016.17},
}
%
@BOOK {Ryser1963,
author = {Ryser, Herbert John},
title = {Combinatorial Mathematics},
publisher = ams,
year = {1963},
}
%
@ARTICLE {LamSW1997,
author = {Lam, Chi-Chung and Sadayappan, P. and Wenger, Rephael},
title = {On optimizing a class of multi-dimensional loops with reduction for parallel execution},
journal = {Parallel Process. Lett.},
volume = {7},
year = {1997},
number = {2},
pages = {157--168},
doi = {10.1142/S0129626497000176},
}
%
@ARTICLE{Cvitanovic1976,
author = {{Cvitanovi\'c}, Predrag},
title = {Group theory for {F}eynman diagrams in non-{A}belian gauge theories},
journal = {Phys. Rev. D},
year = {1976},
pages = {1536-1553},
volume = {14},
number = {6},
doi = {10.1103/PhysRevD.14.1536},
}
%
%
@ARTICLE{CvitanovicK1982,
Author = {{Cvitanovi\'c}, Predrag and Kennedy, Anthony D.},
Title = {Spinors in negative dimensions.},
Journal = {Physica Scripta},
Volume = {26},
Number = {1},
Pages = {5--14},
Year = {1982},
DOI = {10.1088/0031-8949/26/1/001},
}
%
@BOOK{KollerF2009,
author = {Koller, Daphne and Friedman, Nir},
title = {Probabilistic Graphical Models},
publisher = {MIT Press},
year = {2009},
note = {\href{https://mitpress.mit.edu/books/probabilistic-graphical-models}{MIT Press}},
}

#OK
@BOOK{PenroseR1986a,
author = {Penrose, Roger and Rindler, Wolfgang},
title = {Spinors and space-time. {V}ol. 1},
publisher = cup,
year = {1984},
doi = {10.1017/CBO9780511564048},
}

#OK
@ARTICLE{WainwrightJ2008,
title = {Graphical models, exponential families, and variational inference},
author = {Wainwright, Martin J. and Jordan, Michael I.},
journal = FoundTrendsML,
volume = {1},
number = {1--2},
pages = {1--305},
year = {2008},
doi = {10.1561/2200000001},
}

#OK
@ARTICLE {LandsbergQY2012,
author = {Landsberg, Joseph M. and Qi, Yang and Ye, Ke},
title = {On the geometry of tensor network states},
journal = qic,
volume = {12},
number = {3\& 4},
year = {2012},
pages = {346--354},
doi = {10.26421/QIC12.3-4-12},
}
%
%
@ARTICLE{Cayley1875,
author = {Cayley, Arthur},
title = {On the theory of the analytical forms called trees},
journal = {The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science},
volume = {13},
number = {85},
year = {1857},
pages = {172--176},
doi = {10.1080/14786445708642275},
}
%
@ARTICLE{Cayley1879,
  author = {Cayley, Arthur},
  title = {On the analytical forms called trees, part {II}},
  journal = {The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science},
  volume = {18},
  number = {121},
  year = {1859},
  pages = {374--378},
  doi = {10.1080/14786445908642782}
}

#OK
%
@ARTICLE {Clifford1878,
author = {Clifford, William K.},
title = {Extract of a Letter to {M}r. {S}ylvester from {P}rof. {C}lifford of {U}niversity {C}ollege, {L}ondon},
journal = AmerJMath,
volume = {1},
number = {2},
year = {1878},
pages = {126--128},
doi = {10.2307/2369303},
}

#OK
%
%
@ARTICLE {Clebsch1861,
author = {Clebsch, Alfred},
title = {Ueber symbolische {D}arstellung algebraischer {F}ormen},
journal = reine,
volume = {59},
year = {1861},
pages = {1--62},
doi = {10.1515/crll.1861.59.1},
}

#OK
@ARTICLE {Sylvester1878,
author = {Sylvester, James J.},
title = {On an Application of the New Atomic Theory to the Graphical Representation of the Invariants and Covariants of Binary Quantics, with Three Appendices},
journal = AmerJMath,
volume = {1},
year = {1878},
number = {1},
pages = {64--104},
doi = {10.2307/2369436},
}

#OK
%
@ARTICLE {Kempe1885,
author = {Kempe, Alfred Bray},
title = {On the Application of {C}lifford's Graphs to Ordinary Binary Quantics},
journal = plms,
volume = {17},
number = {1},
year = {1885},
pages = {107--123},
doi = {10.1112/plms/s1-17.1.107},
}

#OK
%
@ARTICLE {Kempe1892,
author = {Kempe, Alfred Bray},
title = {On the application of the {S}ylvester--{C}lifford Graphs to Ordinary Binary Quantics. ({S}econd Part.)},
journal = plms,
volume = {24},
number = {1},
year = {1892},
pages = {97--118},
doi = {10.1112/plms/s1-24.1.97},
}


#OK
@ARTICLE{BjorklundHK2009,
author = {Bj{\"{o}}rklund, Andreas and Husfeldt, Thore and Koivisto, Mikko},
title = {Set Partitioning via Inclusion-Exclusion},
journal = sicomp,
volume = {39},
number = {2},
pages = {546--563},
year = {2009},
doi = {10.1137/070683933},
}

#OK
@INPROCEEDINGS{BjorklundHKK2008,
author = {Bj{\"{o}}rklund, Andreas and Husfeldt, Thore and Kaski, Petteri and Koivisto, Mikko},
title = {Computing the {T}utte Polynomial in Vertex-Exponential Time},
crossref = {pfocs08},
pages = {677--686},
doi = {10.1109/FOCS.2008.40},
eprint = {0711.2585},
}

#OK
@ARTICLE {RichterGebertL2009,
author = {Richter-Gebert, J{\"{u}}rgen and Lebmeir, Peter},
title = {Diagrams, tensors and geometric reasoning},
journal = DiscrComputGeom,
volume = {42},
year = {2009},
number = {2},
pages = {305--334},
doi = {10.1007/s00454-009-9188-9},
}

#OK
@ARTICLE{AlonYZ1997,
author = {Alon, Noga and Yuster, Raphael and Zwick, Uri},
title = {Finding and Counting Given Length Cycles},
journal = Algorithmica,
volume = {17},
number = {3},
pages = {209--223},
year = {1997},
doi = {10.1007/BF02523189},
note = {\prelim \href{https://doi.org/10.1007/BFb0049422}{ESA'94}},
}

#OK
@ARTICLE{AlonG2010,
author = {Alon, Noga and Gutner, Shai},
title = {Balanced families of perfect hash functions and their applications},
journal = talg,
volume = {6},
number = {3},
pages = {54:1--12},
year = {2010},
doi = {10.1145/1798596.1798607},
note = {\prelim \href{https://doi.org/10.1007/978-3-540-73420-8\_39}{ICALP'07}},
eprint = {0805.4300},
}

#OK
@INPROCEEDINGS{BjorklundHKK2009,
author = {Bj{\"{o}}rklund, Andreas and Husfeldt, Thore and Kaski, Petteri and Koivisto, Mikko},
title = {Counting Paths and Packings in Halves},
crossref = {pesa09},
pages = {578--586},
doi = {10.1007/978-3-642-04128-0\_52},
eprint = {0904.3093},
}


#OK
%
@article{BjorklundKK2014,
author = {Bj{\"{o}}rklund, Andreas and Kaski, Petteri and Kowalik, {\L{}}ukasz},
title = {Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time},
journal = talg,
volume = {13},
number = {4},
pages = {48:1--26},
year = {2017},
doi = {10.1145/3125500},
note = {\prelim \href{https://doi.org/10.1137/1.9781611973402.45}{SODA'14}},
eprint = {1306.4111},
}
%
@INPROCEEDINGS{BjorklundKK2014-orig,
  author    = {Andreas Bj{\"{o}}rklund and
               Petteri Kaski and
               {\L{}}ukasz Kowalik},
  title     = {Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time},
  booktitle = {Proc.~of Symposium on Discrete Algorithms ({SODA})},
  pages     = {594--603},
  year      = {2014},
  doi       = {10.1137/1.9781611973402.45},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.dagstuhl.de/rec/bib/conf/soda/BjorklundKK14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

#OK
%
@ARTICLE{ItaiR1978,
author = {Itai, Alon and Rodeh, Michael},
title = {Finding a Minimum Circuit in a Graph},
journal = sicomp,
volume = {7},
number = {4},
pages = {413--423},
year = {1978},
doi = {10.1137/0207033},
note = {\prelim \href{https://doi.org/10.1145/800105.803390}{STOC'77}},
}

#OK
@ARTICLE {EisenbrandG2004,
author = {Eisenbrand, Friedrich and Grandoni, Fabrizio},
title = {On the complexity of fixed parameter clique and dominating set},
journal = tcs,
volume = {326},
number = {1--3},
year = {2004},
pages = {57--67},
doi = {10.1016/j.tcs.2004.05.009},
}

#OK
@ARTICLE {ItaiL2010,
author = {Arad, Itai and Landau, Zeph},
title = {Quantum computation and the evaluation of tensor networks},
journal = sicomp,
volume = {39},
number = {7},
year = {2010},
pages = {3089--3121},
doi = {10.1137/080739379},
}

#OK
@ARTICLE {Schrijver2015a,
author = {Schrijver, Alexander},
title = {On traces of tensor representations of diagrams},
journal = LiAlgAppl,
volume = {476},
year = {2015},
pages = {28--41},
doi = {10.1016/j.laa.2015.02.037},
}
%
%
@INCOLLECTION {Penrose1971,
AUTHOR = {Penrose, Roger},
TITLE = {Applications of negative dimensional tensors},
BOOKTITLE = {Combinatorial {M}athematics and its {A}pplications},
editor = {D. J. A. Welsh},
PAGES = {221--244},
YEAR = {1971},
publisher = {Academic Press},
note = {\href{https://www.mscs.dal.ca/~selinger/papers/graphical-bib/public/Penrose-applications-of-negative-dimensional-tensors.pdf}{LINK}},
}

#OK
@PHDTHESIS {Penrose1956,
author = {Penrose, Roger},
title = {Tensor Methods in Algebraic Geometry},
school = {St. John's College},
institution = {Cambridge},
year = {1956},
}
%
%
@INCOLLECTION {Kauffman1989,
author = {Kauffman, Louis H.},
title = {Knots, abstract tensors and the {Y}ang-{B}axter equation},
booktitle = {Knots, Topology and Quantum Field Theories},
editor = {Lussana, L.},
PAGES = {179--334},
YEAR = {1989},
publisher = {World Scientific},
}
%
@ARTICLE {Kuperberg1991,
author = {Kuperberg, Greg},
title = {Involutory {H}opf algebras and {$3$}-manifold invariants},
journal = InternatJMath,
volume = {2},
year = {1991},
number = {1},
pages = {41--66},
doi = {10.1142/S0129167X91000053},
}
%
%
@ARTICLE{PfeiferHV2014,
author = {Pfeifer, Robert N. C. and Haegeman, Jutho and Verstraete, Frank},
title = {Faster identification of optimal contraction sequences for tensor networks},
journal = {Phys. Rev. E},
volume = {90},
number = {3},
year = {2014},
doi = {10.1103/PhysRevE.90.033315},
}

#OK
@INPROCEEDINGS{BacchusDP2003,
author = {Bacchus, Fahiem and Dalmao, Shannon and Pitassi, Toniann},
title = {Algorithms and Complexity Results for {\#}{SAT} and {B}ayesian Inference},
crossref = {pfocs03},
pages = {340--351},
doi = {10.1109/SFCS.2003.1238208},
}

#OK
@ARTICLE{HillarL2013,
author = {Hillar, Christopher J. and Lim, Lek{-}Heng},
title = {Most Tensor Problems Are {NP}-Hard},
journal = jacm,
volume = {60},
number = {6},
pages = {45:1--39},
year = {2013},
doi = {10.1145/2512329},
eprint = {0911.1393},
}


#OK
@ARTICLE{CapelliDM2016,
author = {Capelli, Florent and Durand, Arnaud and Mengel, Stefan},
title = {The Arithmetic Complexity of Tensor Contraction},
journal = ThyCompSys,
volume = {58},
number = {4},
pages = {506--527},
year = {2016},
doi = {10.1007/s00224-015-9630-8},
note = {\prelim \href{https://doi.org/10.4230/LIPIcs.STACS.2013.365}{STACS'13}},
eprint = {1209.4865},
}

#OK
@ARTICLE {BunchH1974,
author = {Bunch, James R. and Hopcroft, John E.},
title = {Triangular factorization and inversion by fast matrix multiplication},
journal = MathComp,
year = {1974},
volume = {28},
number = {125},
pages = {231--236},
doi = {10.1090/S0025-5718-1974-0331751-8},
}
%
@Article{BiamonteMT2015,
author = {Biamonte, Jacob D. and Morton, Jason and Turner, Jacob},
title = {Tensor Network Contractions for {\#}{SAT}},
journal = {J. Stat. Phys.},
year = {2015},
volume = {160},
number = {5},
pages = {1389--1404},
doi = {10.1007/s10955-015-1276-z},
eprint = {1405.7375},
}
%
@misc{SolomonikH2015,
author = {Solomonik, Edgar and Hoefler, Torsten},
title = {Sparse Tensor Algebra as a Parallel Programming Model},
eprint = {1512.00066},
year = {2015},
}

@ARTICLE{SolomonikH2015-orig,
author = {Solomonik, Edgar and Hoefler, Torsten},
title = {Sparse Tensor Algebra as a Parallel Programming Model},
journal = {Computing Research Repository},
year = {2015},
eprint = {1512.00066},
}
%
@ARTICLE{SolomonikMHSD2014,
author = {Solomonik, Edgar and Matthews, Devin and Hammond, Jeff R. and Stanton, John F. and Demmel, James},
title = {A massively parallel tensor contraction framework for coupled-cluster computations},
journal = {J. Parallel Distrib. Comput.},
volume = {74},
number = {12},
pages = {3176--3190},
year = {2014},
doi = {10.1016/j.jpdc.2014.06.002},
}

#OK
@ARTICLE{Berkowitz1984,
author = {Berkowitz, Stuart J.},
title = {On Computing the Determinant in Small Parallel Time Using a Small Number of Processors},
journal = ipl,
volume = {18},
number = {3},
pages = {147--150},
year = {1984},
doi = {10.1016/0020-0190(84)90018-8},
}
%
@incollection{Rote2001,
author = {Rote, G{\"{u}}nter},
title = {Division-Free Algorithms for the Determinant and the {P}faffian: Algebraic and Combinatorial Approaches},
editor = {Helmut Alt},
booktitle = {Computational Discrete Mathematics, Advanced Lectures},
pages = {119--135},
doi = {10.1007/3-540-45506-X\_9},
year = 2001,
publisher = springer,
}

#OK
@ARTICLE{Raz2013,
author = {Raz, Ran},
title = {Tensor-Rank and Lower Bounds for Arithmetic Formulas},
journal = jacm,
volume = {60},
number = {6},
pages = {40:1--15},
year = {2013},
doi = {10.1145/2535928},
note = {\prelim \href{https://doi.org/10.1145/1806689.1806780}{STOC'10}},
eprint = {eccc:TR10-002},
}

#OK
@ARTICLE{DammHM2002,
author = {Damm, Carsten and Holzer, Markus and McKenzie, Pierre},
title = {The complexity of tensor calculus},
journal = ccomplex,
volume = {11},
number = {1--2},
pages = {54--89},
year = {2002},
doi = {10.1007/s00037-000-0170-4},
note = {\prelim \href{https://doi.org/10.1109/CCC.2000.856737}{CCC'00}},
eprint = {eccc:TR00-036},
}


#OK
@ARTICLE{BeaudryH2007,
author = {Beaudry, Martin and Holzer, Markus},
title = {The Complexity of Tensor Circuit Evaluation},
journal = ccomplex,
volume = {16},
number = {1},
pages = {60--111},
year = {2007},
doi = {10.1007/s00037-007-0222-0},
note = {\prelim \href{https://doi.org/10.1007/3-540-44683-4\_16}{MFCS'01}},
}

#OK
@ARTICLE{CaiGW2016a,
author = {Cai, Jin{-}Yi and Guo, Heng and Williams, Tyson},
title = {A Complete Dichotomy Rises from the Capture of Vanishing Signatures},
journal = sicomp,
volume = {45},
number = {5},
pages = {1671--1728},
year = {2016},
doi = {10.1137/15M1049798},
note = {\prelim \href{https://doi.org/10.1145/2488608.2488687}{STOC'13}},
eprint = {1204.6445},
}

#OK
@ARTICLE{CaiLX2011,
author = {Cai, Jin{-}yi and Lu, Pinyan and Xia, Mingji},
title = {Computational Complexity of {H}olant Problems},
journal = sicomp,
volume = {40},
number = {4},
pages = {1101--1132},
year = {2011},
doi = {10.1137/100814585},
}

#OK
@ARTICLE{Valiant2008,
author = {Valiant, Leslie G.},
title = {Holographic Algorithms},
journal = sicomp,
volume = {37},
number = {5},
pages = {1565--1594},
year = {2008},
doi = {10.1137/070682575},
note = {\prelim \href{https://doi.org/10.1109/FOCS.2004.34}{FOCS'04}},
eprint = {eccc:TR05-099},
}


#OK
@INPROCEEDINGS{CurticapeanDM2017,
author = {Curticapean, Radu and Dell, Holger and Marx, D{\'{a}}niel},
title = {Homomorphisms are a good basis for counting small subgraphs},
crossref = {pstoc17},
pages = {210--223},
doi = {10.1145/3055399.3055502},
eprint = {1705.01595},
}
%
@INPROCEEDINGS{BensonB2015,
author = {Benson, Austin R. and Ballard, Grey},
title = {A framework for practical parallel fast matrix multiplication},
crossref = {pPPoPP15},
pages = {42--53},
doi = {10.1145/2688500.2688513},
eprint = {1409.2908},
}
%
@INPROCEEDINGS{HuangRMG2017,
author = {Huang, Jianyu and Rice, Leslie and Matthews, Devin A. and van de Geijn, Robert A.},
title = {Generating Families of Practical Fast Matrix Multiplication Algorithms},
crossref = {pIPDPS17},
pages = {656--667},
doi = {10.1109/IPDPS.2017.56},
eprint = {1611.01120},
}

#OK
@BOOK{VanLoan1992,
author = {Van Loan, Charles},
title = {Computational Frameworks for the Fast Fourier Transform},
year = 1992,
publisher = siam,
doi = {10.1137/1.9781611970999},
}

#OK
@BOOK {Buergisser1997,
author = {B{\"u}rgisser, Peter and Clausen, Michael and Shokrollahi, M. Amin},
title = {Algebraic Complexity Theory},
publisher = springer,
year = {1997},
doi = {10.1007/978-3-662-03338-8},
}
%
@BOOK{Yates1937,
author = {Yates, Frank},
title = {The Design and Analysis of Factorial Experiments},
publisher = {Imperial Bureau of Soil Science},
year = 1937,
note = {\href{https://repository.rothamsted.ac.uk/download/da923ac105983581f7731b3062a119a7e690931c120a16aad0550dd9c527e8fe/10768968/The\%20Design\%20and\%20Analysis.pdf}{Rothamsted Repository}},
}

#OK
@INPROCEEDINGS{AbboudBBK2017,
author = {Abboud, Amir and Backurs, Arturs and Bringmann, Karl and K{\"{u}}nnemann, Marvin},
title = {Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve},
crossref = {pfocs17},
pages = {192--203},
doi = {10.1109/FOCS.2017.26},
eprint = {1803.00796},
}
%
@article{AbboudBW15a,
author={Abboud, Amir and Backurs, Arturs and Vassilevska Williams, Virginia},
title = {If the Current Clique Algorithms are Optimal, So is {V}aliant's Parser},
journal = sicomp,
volume = {47},
number = {6},
pages = {2527--2555},
year = {2018},
doi = {10.1137/16M1061771},
note = {\prelim \href{https://doi.org/10.1109/FOCS.2015.16}{FOCS'15}},
eprint = {1504.01431},
}
%
@INPROCEEDINGS{AbboudBW15a-orig,
author = {Amir Abboud and Arturs Backurs and Virginia Vassilevska Williams},
title = {If the Current Clique Algorithms are Optimal, So is {V}aliant's Parser},
  booktitle = {Proc.~of Foundations of Computer Science ({FOCS})},
  pages     = {98--117},
  year      = {2015},
  doi       = {10.1109/FOCS.2015.16},
  timestamp = {Fri, 19 May 2017 01:25:58 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/AbboudBW15a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
%
%
@ARTICLE {Nesetril1985,
author = {Ne{\v{s}}et{\v{r}}il, Jarik and Poljak, Svatopluk},
title = {On the complexity of the subgraph problem},
journal = {Commentationes Mathematicae Universitatis Carolinae},
volume = {26},
year = {1985},
number = {2},
pages = {415--419},
note = {\href{https://eudml.org/doc/17394}{EuDML}},
}
%
@article{Williams14apsp,
author = {Williams, R. Ryan},
title = {Faster all-pairs shortest paths via circuit complexity},
journal = sicomp,
year = 2018,
volume = 47,
number = 5,
pages = {1965-1985},
doi = {10.1137/15M1024524},
note = {\prelim \href{https://doi.org/10.1145/2591796.2591811}{STOC'14}},
}
%
@INPROCEEDINGS{Williams14apsp-orig,
author = {Williams, R. Ryan},
title = {Faster all-pairs shortest paths via circuit complexity},
crossref = {pstoc14},
pages = {664--673},
doi = {10.1145/2591796.2591811},
}


#OK
%
@ARTICLE{WilliamsW2013,
author = {Vassilevska Williams, Virginia and Williams, R. Ryan},
title = {Finding, Minimizing, and Counting Weighted Subgraphs},
journal = sicomp,
volume = {42},
number = {3},
pages = {831--854},
year = {2013},
doi = {10.1137/09076619X},
note = {\prelim \href {https://doi.org/10.1145/1536414.1536477}{STOC'09}},
}

 #OK
@ARTICLE{FominLRSR2012,
author = {Fomin, Fedor V. and Lokshtanov, Daniel and Raman, Venkatesh and Saurabh, Saket and Rao, B. V. Raghavendra},
title = {Faster algorithms for finding and counting subgraphs},
journal = jcss,
volume = {78},
number = {3},
pages = {698--706},
year = {2012},
doi = {10.1016/j.jcss.2011.10.001},
eprint = {0912.2371},
}

#OK
@ARTICLE{FloderusKLL2015,
author = {Floderus, Peter and Kowaluk, Miroslaw and Lingas, Andrzej and Lundell, Eva{-}Marta},
title = {Detecting and Counting Small Pattern Graphs},
journal = sidma,
volume = {29},
number = {3},
pages = {1322--1339},
year = {2015},
doi = {10.1137/140978211},
note = {\prelim \href{https://doi.org/10.1007/978-3-642-45030-3\_51}{ISAAC'13}},
}

#OK
@ARTICLE{Olariu1988,
author = {Olariu, Stephan},
title = {Paw-Free Graphs},
journal = ipl,
volume = {28},
number = {1},
pages = {53--54},
year = {1988},
doi = {10.1016/0020-0190(88)90143-3},
}
%
@ARTICLE{KloksKM2000,
author = {Kloks, Ton and Kratsch, Dieter and M{\"{u}}ller, Haiko},
title = {Finding and counting small induced subgraphs efficiently},
journal = ipl,
volume = {74},
number = {3--4},
pages = {115--121},
year = {2000},
doi = {10.1016/S0020-0190(00)00047-8},
note = {\prelim \href{https://doi.org/10.1007/3-540-60618-1\_62}{WG'95}},
}

#OK
%
@INPROCEEDINGS{WilliamsWWY15,
author = {Vassilevska Williams, Virginia and Wang, Joshua R. and Williams, R. Ryan and Yu, Huacheng},
title = {Finding Four-Node Subgraphs in Triangle Time},
crossref = {psoda15},
pages = {1671--1680},
doi = {10.1137/1.9781611973730.111},
}

#OK
@ARTICLE {Kolda2009,
author = {Kolda, Tamara Gibson and Bader, Brett W.},
title = {Tensor decompositions and applications},
journal = SIAMRev,
volume = {51},
number = {3},
year = {2009},
pages = {455--500},
doi = {10.1137/07070111X},
}
%
@techreport{Kolda2006,
author = {Kolda, Tamara Gibson},
title = {Multilinear operators for higher-order decompositions},
number = {SAND2006-2081},
institution = {Sandia National Laboratories},
year = 2006,
doi = {10.2172/923081},
}
%
@MISC{Kolda2006-orig,
  author = {Tamara G. Kolda},
  title = {Multilinear operators for higher-order decompositions},
  howpublished = {Tech Report SAND2006-2081, Sandia National Laboratories},
  year = 2006,
  doi = {10.2172/923081}
}


#OK
@ARTICLE {Kruskal1977,
author = {Kruskal, Joseph B.},
title = {Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics},
journal = LiAlgAppl,
volume = {18},
year = {1977},
number = {2},
pages = {95--138},
doi = {10.1016/0024-3795(77)90069-6},
}

#OK
%
@INPROCEEDINGS{VassilevskaWilliams2012,
author = {Vassilevska Williams, Virginia},
title = {Multiplying matrices faster than {C}oppersmith--{W}inograd},
crossref = {pstoc12},
pages = {887--898},
doi = {10.1145/2213977.2214056},
}
%
@misc{Pan2014,
author = {Pan, Victor Y.},
title = {Matrix Multiplication, Trilinear Decompositions, {APA} Algorithms, and Summation},
eprint = {1412.1145},
year = {2014},
}

@ARTICLE{Pan2014-orig,
  author    = {Victor Y. Pan},
  title     = {Matrix Multiplication, Trilinear Decompositions, {APA} Algorithms, and Summation},
  journal   = {arXiv:1412.1145},
  volume     = {},
  year      = {2014},
}

#OK
@BOOK {Landsberg2012,
author = {Landsberg, Joseph M.},
title = {Tensors: Geometry and Applications},
publisher = ams,
year = {2012},
doi = {10.1090/gsm/128},
}
%
@ARTICLE{Orus2014,
author = {Or{\'u}s, Rom{\'a}n},
title = {A practical introduction to tensor networks: {M}atrix product states and projected entangled pair states},
journal = {Ann. Phys.},
volume = {349},
year = {2014},
pages = {117--158},
doi = {10.1016/j.aop.2014.06.013},
eprint = {1306.2164},
}

#OK
@INPROCEEDINGS{CohnU2013,
author = {Cohn, Henry and Umans, Christopher},
title = {Fast matrix multiplication using coherent configurations},
crossref = {psoda13},
pages = {1074--1087},
year = {2013},
doi = {10.1137/1.9781611973105.77},
eprint = {1207.6528},
}

#OK
@INPROCEEDINGS{Cohn2005,
author = {Cohn, Henry and Kleinberg, Robert D. and Szegedy, Bal{\'{a}}zs and Umans, Christopher},
title = {Group-theoretic Algorithms for Matrix Multiplication},
crossref = {pfocs05},
pages = {379--388},
year = {2005},
doi = {10.1109/SFCS.2005.39},
}

#OK
@ARTICLE {Strassen1969,
author = {Strassen, Volker},
title = {Gaussian elimination is not optimal},
journal = NumerMath,
volume = {13},
year = {1969},
number = {4},
pages = {354--356},
doi = {10.1007/BF02165411},
}

#OK
@ARTICLE {Hastad1990,
author = {H{\aa}stad, Johan},
title = {Tensor rank is {NP}-complete},
journal = JAlgorithms,
volume = {11},
year = {1990},
number = {4},
pages = {644--654},
doi = {10.1016/0196-6774(90)90014-6},
note = {\prelim \href{https://doi.org/10.1007/BFb0035776}{ICALP'89}},
}


#OK
@ARTICLE{Williams2005,
author = {Williams, R. Ryan},
title = {A new algorithm for optimal 2-constraint satisfaction and its implications},
journal = tcs,
volume = {348},
number = {2--3},
pages = {357--365},
year = {2005},
doi = {10.1016/j.tcs.2005.09.023},
note = {\prelim \href{https://doi.org/10.1007/978-3-540-27836-8\_101}{ICALP'04}},
}

#OK
@INPROCEEDINGS{LeGallU2017,
author = {Le Gall, Fran{\c{c}}ois and Urrutia, Florent},
title = {Improved rectangular matrix multiplication using powers of the {C}oppersmith-{W}inograd tensor},
crossref = {psoda18},
pages = {1029--1046},
doi = {10.1137/1.9781611975031.67},
eprint = {1708.05622},
}

#OK
@INPROCEEDINGS{LeGall2014,
author = {Le Gall, Fran{\c{c}}ois},
title = {Powers of tensors and fast matrix multiplication},
crossref = {pissac14},
pages = {296--303},
doi = {10.1145/2608628.2608664},
eprint = {1401.7714},
}

#OK
%
@INPROCEEDINGS{LeGall2012,
author = {Le Gall, Fran{\c{c}}ois},
title = {Faster Algorithms for Rectangular Matrix Multiplication},
crossref = {pfocs12},
pages = {514--523},
year = {2012},
doi = {10.1109/FOCS.2012.80},
eprint = {1204.1111},
}

#OK
@ARTICLE{Impagliazzo2001b,
author = {Impagliazzo, Russell and Paturi, Ramamohan and Zane, Francis},
title = {Which Problems Have Strongly Exponential Complexity?},
journal = jcss,
volume = {63},
number = {4},
pages = {512--530},
year = {2001},
doi = {10.1006/jcss.2001.1774},
note = {\prelim \href{https://doi.org/10.1109/SFCS.1998.743516}{FOCS'98}},
}

#OK
@ARTICLE{Impagliazzo2001,
author = {Impagliazzo, Russell and Paturi, Ramamohan},
title = {On the Complexity of $k$-{SAT}},
journal = jcss,
volume = {62},
number = {2},
pages = {367--375},
year = {2001},
doi = {10.1006/jcss.2000.1727},
}
%
@ARTICLE{RobevaS2017,
author = {Robeva, Elina and Seigal, Anna},
title = {Duality of graphical models and tensor networks},
journal = {Inf. Inference},
volume = {8},
number = {2},
pages = {273--288},
year = {2018},
doi = {10.1093/imaiai/iay009},
eprint = {1710.01437},
}

@inproceedings{conf-version,
author = {Austrin, Per and Kaski, Petteri and Kubjas, Kaie},
title  = {Tensor network complexity of multilinear maps},
crossref = {pitcs18},
pages = {7:1--21},
doi = {10.4230/LIPIcs.ITCS.2019.7},
}

%
@article{Csanky1976,
  title={Fast parallel matrix inversion algorithms},
  author={Cs\'anky, L\'aszl\'o},
  journal = sicomp,
  volume = {5},
  number = {4},
  pages = {618--623},
  year = {1976},
  doi = {10.1137/0205040},
  note = {\prelim \href{https://doi.org/10.1109/SFCS.1975.14}{FOCS'75}},
}

