No. Title Author Year
1 Approximate Counting of k-Paths: Deterministic and in Polynomial Space Björklund, Andreas et al. 2019
2 Computing Permanents and Counting Hamiltonian Cycles by Listing Dissimilar Vectors Björklund, Andreas et al. 2019
3 Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction Björklund, Andreas et al. 2019
4 Counting Connected Subgraphs with Maximum-Degree-Aware Sieving Björklund, Andreas et al. 2018
5 Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm Björklund, Andreas et al. 2018
6 Exploiting Sparsity for Bipartite Hamiltonicity Björklund, Andreas 2018
7 Generalized Kakeya Sets for Polynomial Evaluation and Faster Computation of Fermionants Björklund, Andreas et al. 2018
8 Determinant Sums for Hamiltonicity (Invited Talk) Björklund, Andreas 2017
9 Directed Hamiltonicity and Out-Branchings via Generalized Laplacians Björklund, Andreas et al. 2017
10 Below All Subsets for Some Permutational Counting Problems Björklund, Andreas 2016
Current Page :
Number of result pages: 2
Number of documents: 14


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI