| On the Complexity of Conversion Between Classic Real Number Representations
|
2020 |
Kristiansen, Lars |
| On the Interplay Between Inductive Inference of Recursive Functions Complexity Theory and Recursive Numberings
|
2020 |
Zeugmann, Thomas |
| PRAWF: An Interactive Proof System for Program Extraction
|
2020 |
Berger, Ulrich |
| The Computational Significance of Hausdorff’s Maximal Chain Principle
|
2020 |
Schuster, Peter |
| On the Perceptron's Compression
|
2020 |
Moran, Shay |
| #P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method
|
2020 |
Noús, Camille |
| Formal Languages in Information Extraction and Graph Databases
|
2020 |
Martens, Wim |
| Faster Online Computation of the Succinct Longest Previous Factor Array
|
2020 |
Prezza, Nicola |
| Insertion-Deletion Systems with Substitutions I
|
2020 |
Vu, Martin |
| Quantitative Coding and Complexity Theory of Compact Metric Spaces
|
2020 |
Lim, Donghyun |
| Combinatorial Properties of Degree Sequences of 3-Uniform Hypergraphs Arising from Saind Arrays
|
2020 |
Petrakis, losif |
| Functions of Baire Class One over a Bishop Topology
|
2020 |
Petrakis, losif |
| Number of Prefixes in Trace Monoids: Clique Polynomials and Dependency Graphs
|
2020 |
Banderier, Cyril |
| Repetitions in Toeplitz Words and the Thue Threshold
|
2020 |
Boccuto, Antonio |
| Balancing Straight-Line Programs for Strings and Trees
|
2020 |
Lohrey, Markus |
| A Note on Computable Embeddings for Ordinals and Their Reverses
|
2020 |
Bazhenov, Nikolay |
| Clockability for Ordinal Turing Machines
|
2020 |
Carl, Merlin |
| Some Notes on Spaces of Ideals and Computable Topology
|
2020 |
Brecht, Matthew de |
| Liouville Numbers and the Computational Complexity of Changing Bases
|
2020 |
Jakobsen, Sune Kristian |
| Computable Analysis and Classification Problems
|
2020 |
Downey, Rodney G. |
Tag hinzufügen