No. Title Author Year
1 Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction Björklund, Andreas et al. 2019
2 Counting Connected Subgraphs with Maximum-Degree-Aware Sieving Björklund, Andreas et al. 2018
3 Engineering Motif Search for Large Motifs Kaski, Petteri et al. 2018
4 Generalized Kakeya Sets for Polynomial Evaluation and Faster Computation of Fermionants Björklund, Andreas et al. 2018
5 Tensor Network Complexity of Multilinear Maps Austrin, Per et al. 2018
6 Directed Hamiltonicity and Out-Branchings via Generalized Laplacians Björklund, Andreas et al. 2017
7 The First Parameterized Algorithms and Computational Experiments Challenge Dell, Holger et al. 2017
8 Dense Subset Sum May Be the Hardest Austrin, Per et al. 2016
9 Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time Karppa, Matti et al. 2016
10 Subset Sum in the Absence of Concentration Austrin, Per et al. 2015
11 Probably Optimal Graph Motifs Björklund, Andreas et al. 2013
12 08431 Open Problems -- Moderately Exponential Time Algorithms Fomin, Fedor V. et al. 2008
13 Trimmed Moebius Inversion and Graphs of Bounded Degree Björklund, Andreas et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 13

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