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


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