No. Title Author Year
1 Generalized Kakeya Sets for Polynomial Evaluation and Faster Computation of Fermionants Björklund, Andreas et al. 2018
2 Directed Hamiltonicity and Out-Branchings via Generalized Laplacians Björklund, Andreas et al. 2017
3 The First Parameterized Algorithms and Computational Experiments Challenge Dell, Holger et al. 2017
4 Dense Subset Sum May Be the Hardest Austrin, Per et al. 2016
5 Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time Karppa, Matti et al. 2016
6 Subset Sum in the Absence of Concentration Austrin, Per et al. 2015
7 Probably Optimal Graph Motifs Björklund, Andreas et al. 2013
8 08431 Open Problems -- Moderately Exponential Time Algorithms Fomin, Fedor V. et al. 2008
9 Trimmed Moebius Inversion and Graphs of Bounded Degree Björklund, Andreas et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 9


DROPS-Home | Fulltext Search | Imprint Published by LZI