| Robust Online Algorithms for Dynamic Choosing Problems
|
2021 |
Berndt, Sebastian |
| Randomising Realizability
|
2021 |
Carl, Merlin |
| Formally Computing with the Non-computable
|
2021 |
Cohen, Liron |
| Subrecursive Equivalence Relations and (non-)Closure Under Lattice Operations
|
2021 |
Moyen, Jean-Yves |
| An Algorithmic Version of Zariski’s Lemma
|
2021 |
Wiesnet, Franziskus |
| On Measure Quantifiers in First-Order Arithmetic
|
2021 |
Antonelli, Melissa |
| Searching for Applicable Versions of Computable Structures
|
2021 |
Alaev, P. E. |
| On the Degrees of Constructively Immune Sets
|
2021 |
Birns, Samuel D. |
| Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry
|
2021 |
Bringmann, Karl |
| Complexity and Categoricity of Injection Structures Induced by Finite State Transducers
|
2021 |
Krogman, Richard |
| Placing Green Bridges Optimally, with a Multivariate Analysis
|
2021 |
Fluschnik, Till |
| Defining Formal Explanation in Classical Logic by Substructural Derivability
|
2021 |
Genco, Francesco A. |
| Towards a Map for Incremental Learning in the Limit from Positive and Negative Information
|
2021 |
Khazraei, Ardalan |
| Compression Techniques in Group Theory
|
2021 |
Lohrey, Markus |
| Effective Inseparability and Its Applications
|
2021 |
Sorbi, Andrea |
| Simple Betting and Stochasticity
|
2021 |
Steifer, Tomasz |
| Constructive Mathematics, Church’s Thesis, and Free Choice Sequences
|
2021 |
Turner, D. A. |
| Restrictions of Hindman’s Theorem: An Overview
|
2021 |
Carlucci, Lorenzo |
| Mapping Monotonic Restrictions in Inductive Inference
|
2021 |
Doskoč, Vanja |
| On False Heine/Borel Compactness Principles in Proot Mining
|
2021 |
Ferreira, Fernando |
Tag hinzufügen