No. Title Author Year
1 Tight Conditional Lower Bounds for Longest Common Increasing Subsequence Duraj, Lech et al. 2018
2 On the Fine-Grained Complexity of One-Dimensional Dynamic Programming Künnemann, Marvin et al. 2017
3 Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem Doerr, Benjamin et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 3


DROPS-Home | Fulltext Search | Imprint Published by LZI