Fetching the paper…
Reading the bibliography…
We introduce new and simple algorithms for the calculation of the number of perfect matchings of complex weighted, undirected graphs with and without loops.
Combinatorial mathematics
Herbert John Ryser · 1963
Earlier work this paper cites.
Topological index. a newly proposed quantity characterizing the topological nature of structural isomers of saturated hydrocarbons
Haruo Hosoya · 1971
Earlier work this paper cites.
Handbook of mathematical functions: with formulas, graphs, and mathematical tables
Milton Abramowitz and Irene A Stegun · 1972
Earlier work this paper cites.
The complexity of computing the permanent
Leslie G Valiant · 1979
Earlier work this paper cites.
Combinatorics and diagonals of matrices
K. Balasubramanian · 1980
Earlier work this paper cites.
Fast algorithms for the characteristics polynomial
Walter Keller-Gehrig · 1985
Earlier work this paper cites.
Matrix analysis
Roger A Horn, Roger A Horn, and Charles R Johnson · 1990
Earlier work this paper cites.
Nearly optimal algorithms for canonical matrix forms
Mark Giesbrecht · 1995
Earlier work this paper cites.
A finite-difference sieve to compute the permanent
E. Bax and J. Franklin · 1996
Earlier work this paper cites.
Two algorithmic results for the traveling salesman problem
Alexander I Barvinok · 1996
Earlier work this paper cites.
The Art of Computer Programming, Vol. 2: Seminumerical Algorithms
Donald E. Knuth · 1998
Earlier work this paper cites.
An o (n 3) algorithm for the frobenius normal form
Arne Storjohann · 1998
Earlier work this paper cites.
Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor
Alexander Barvinok · 1999
Earlier work this paper cites.
LAPACK Users’ guide
Edward Anderson, Zhaojun Bai, Christian Bischof, L Susan Blackford, James Demmel, Jack Dongarra, Jeremy Du Croz, Anne Greenbaum, Sven Hammarling, Alan McKenney, et al · 1999
Earlier work this paper cites.
Macmahon’s master theorem, representation theory, and moments of wishart distributions
I-Li Lu and Donald St P Richards · 2001
Earlier work this paper cites.
Alternative algorithms for counting all matchings in graphs
Piotr Sankowski · 2003
Cited alongside, same era.
A determinant-based algorithm for counting perfect matchings in a general graph
Steve Chien · 2004
Cited alongside, same era.
Non-commutative extensions of the macmahon master theorem
Matjaz Konvalinka and Igor Pak · 2006
Cited alongside, same era.
Symmetric functionals on random matrices and random matchings problems
Grzegorz Rempala and Jacek Wesolowski · 2007
Cited alongside, same era.
Exact algorithms for exact satisfiability and number of perfect matchings
Andreas Björklund and Thore Husfeldt · 2008
Cited alongside, same era.
From moments of sum to moments of product
Raymond Kan · 2008
Cited alongside, same era.
Approximating permanents and hafnians
Alexander Barvinok · 2016
Later among the works it cites.
Hafnians, perfect matchings and gaussian matrices
Mark Rudelson, Alex Samorodnitsky, Ofer Zeitouni, et al · 2016
Later among the works it cites.
Classical boson sampling algorithms with superior performance to near-term experiments
Alex Neville, Chris Sparrow, Raphaël Clifford, Eric Johnston, Patrick M Birchall, Ashley Montanaro, and Anthony Laing · 2017
Later among the works it cites.
Gaussian boson sampling
Craig S Hamilton, Regina Kruse, Linda Sansoni, Sonja Barkhofen, Christine Silberhorn, and Igor Jex · 2017
Later among the works it cites.
Quantum computational supremacy
Aram W Harrow and Ashley Montanaro · 2017
Later among the works it cites.
An efficient gpu implementation of bulk computation of the eigenvalue problem for many small real non-symmetric matrices
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Computing minimal polynomials of matrices
Max Neunhöffer and Cheryl E Praeger · 2008
Cited alongside, same era.
Partitioning into sets of bounded cardinality
Mikko Koivisto · 2009
Cited alongside, same era.
Fast polynomial-space algorithms using möbius inversion: Improving on steiner tree and related problems
Jesper Nederlof · 2009
Cited alongside, same era.
The computational complexity of linear optics
Scott Aaronson and Alex Arkhipov · 2011
Cited alongside, same era.
Invitation to algorithmic uses of inclusion–exclusion
Thore Husfeldt · 2011
Cited alongside, same era.
Counting perfect matchings as fast as ryser
Andreas Björklund · 2012
Cited alongside, same era.
Hiroki Tokura, Takumi Honda, Yasuaki Ito, Koji Nakano, Mitsuya Nishino, Yushiro Hirota, and Masami Saeki · 2017
Later among the works it cites.
A benchmark test of boson sampling on tianhe-2 supercomputer
Junjie Wu, Yong Liu, Baida Zhang, Xianmin Jin, Yang Wang, Huiquan Wang, and Xuejun Yang · 2018
Closest in time.
The classical complexity of boson sampling
Peter Clifford and Raphaël Clifford · 2018
Closest in time.
A detailed study of gaussian boson sampling
Regina Kruse, Craig S Hamilton, Linda Sansoni, Sonja Barkhofen, Christine Silberhorn, and Igor Jex · 2018
Closest in time.
Gaussian boson sampling using threshold detectors
Nicolás Quesada, Juan Miguel Arrazola, and Nathan Killoran · 2018
Closest in time.
Classical benchmarking of gaussian boson sampling on the titan supercomputer
Brajesh Gupt, Juan Miguel Arrazola, Nicolás Quesada, and Thomas R Bromley · 2018
Closest in time.
https://github.com/XanaduAI/hafnian , 2018
hafnian · 2018
Closest in time.
Franck-condon factors by counting perfect matchings of graphs with loops
Nicolás Quesada · 2019
Closest in time.
Strawberry Fields: A Software Platform for Photonic Quantum Computing
Nathan Killoran, Josh Izaac, Nicolás Quesada, Ville Bergholm, Matthew Amy, and Christian Weedbrook · 2019
Closest in time.