9 citations · 11 across the 4 of their papers we have counts for
4 papers
The Asymptotic Rank Conjecture and the Set Cover Conjecture are not Both True
Andreas Björklund, Petteri Kaski
Strassen's asymptotic rank conjecture [Progr. Math. 120 (1994)] claims a strong submultiplicative upper bound on the rank of a three-tensor obtained as an iterated Kronecker produc…
The Parity of Directed Hamiltonian Cycles
Andreas Björklund, Thore Husfeldt
We present a deterministic algorithm that given any directed graph on n vertices computes the parity of its number of Hamiltonian cycles in O(1.619^n) time and polynomial space. Fo…
Determinant Sums for Undirected Hamiltonicity
Andreas Björklund
We present a Monte Carlo algorithm for Hamiltonicity detection in an -vertex undirected graph running in time. To the best of our knowledge, this is the first s…
Exact Covers via Determinants
Andreas Björklund
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-dimensional matching problem asks wheth…