No. Title Author Year
1 Near-Optimal Complexity Bounds for Fragments of the Skolem Problem Akshay, S. et al. 2020
2 On the Complexity of Value Iteration Balaji, Nikhil et al. 2019
3 Complexity of Restricted Variants of Skolem and Related Problems S., Akshay et al. 2017
4 Graph Properties in Node-Query Setting: Effect of Breaking Symmetry Balaji, Nikhil et al. 2016
5 Counting Euler Tours in Undirected Bounded Treewidth Graphs Balaji, Nikhil et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 5

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