Below all subsets for some permutational counting problems

DOI10.4230/LIPICS.SWAT.2016.17MaRDI QIDQ5369519zbMATH OpenFDO

Authors Andreas Björklund

Publication date 17 October 2017

Full work available at URL https://arxiv.org/abs/1211.0391

zbMATH Keywords

asymmetric TSPHamiltonian cyclesmatrix permanent

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Determinants, permanents, traces, other special matrix functions (15A15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3930346
• Computing the permanent modulo a prime power
• Exponential Time Complexity of the Permanent and the Tutte Polynomial
• Computing the permanent of (some) complex matrices
• Computing sparse permanents faster

Cited in

(8)

• Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
• Computing the permanent modulo a prime power
• The parity of set systems under random restrictions with applications to exponential time problems
• The set cover conjecture and subgraph isomorphism with a tree pattern
• scientific article; zbMATH DE number 7561499 (Why is no real title available?)
• Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors
• Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
• Counting short vector pairs by inner product and relations to the permanent

This page was built for publication: Below all subsets for some permutational counting problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5369519)