No. Title Author Year
1 Cryptographic Hardness Under Projections for Time-Bounded Kolmogorov Complexity Allender, Eric et al. 2021
2 Depth-First Search in Directed Planar Graphs, Revisited Allender, Eric et al. 2021
3 One-Way Functions and a Conditional Variant of MKTP Allender, Eric et al. 2021
4 Structure and Complexity (Dagstuhl Seminar 9640) Allender, Eric et al. 2021
5 Syntactic Separation of Subset Satisfiability Problems Allender, Eric et al. 2019
6 Minimum Circuit Size, Graph Isomorphism, and Related Problems Allender, Eric et al. 2018
7 Better Complexity Bounds for Cost Register Automata Allender, Eric et al. 2017
8 New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems Allender, Eric et al. 2017
9 The Minimum Oracle Circuit Size Problem Allender, Eric et al. 2015
10 On the Complexity of Numerical Analysis Allender, Eric et al. 2006
Current Page :
Number of result pages: 1
Number of documents: 10


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