|
A Journey to Computably Enumerable Structures (Tutorial Lectures) |
|
|
1 | (19) |
|
|
|
Polynomial-Time Presentations of Algebraic Number Fields |
|
|
20 | (10) |
|
|
|
|
|
Multiple Permitting and Array Noncomputability |
|
|
30 | (10) |
|
|
|
Degrees of Categoricity for Prime and Homogeneous Models |
|
|
40 | (10) |
|
|
|
|
|
Universality in Freezing Cellular Automata |
|
|
50 | (10) |
|
|
|
|
|
|
|
|
|
A Deontic Logic Reasoning Infrastructure |
|
|
60 | (10) |
|
|
|
|
|
|
|
Optimized Program Extraction for Induction and Coinduction |
|
|
70 | (11) |
|
|
|
|
|
Computing Tree Width: From Theory to Practice and Back |
|
|
81 | (8) |
|
|
|
Using Structural Properties for Integer Programs |
|
|
89 | (8) |
|
|
|
|
|
From Eventually Different Functions to Pandemic Numberings |
|
|
97 | (10) |
|
|
|
|
|
|
|
|
|
Divide and Conquer Computation of the Multi-string BWT and LCP Array |
|
|
107 | (11) |
|
|
|
|
|
|
|
|
|
|
|
|
|
Some Observations on Infinitary Complexity |
|
|
118 | (8) |
|
|
|
|
|
126 | (10) |
|
|
|
|
|
|
|
Online Computability and Differentiation in the Cantor Space |
|
|
136 | (10) |
|
|
|
|
|
Turing's Vision and Deep Learning |
|
|
146 | (10) |
|
|
|
Computing and Scheduling with Explorable Uncertainty |
|
|
156 | (5) |
|
|
|
Diminishable Parameterized Problems and Strict Polynomial Kernelization |
|
|
161 | (11) |
|
|
|
|
|
|
|
|
|
|
|
|
|
New Nonterminal Complexity Results for Semi-conditional Grammars |
|
|
172 | (11) |
|
|
|
|
|
|
|
Kernelization Lower Bounds for Finding Constant-Size Subgraphs |
|
|
183 | (11) |
|
|
|
|
|
|
|
On General Sum Approximations of Irrational Numbers |
|
|
194 | (10) |
|
|
|
|
|
|
|
Computability of Ordinary Differential Equations |
|
|
204 | (10) |
|
|
|
|
|
Topological Analysis of Representations |
|
|
214 | (10) |
|
|
|
A Unified Framework for Designing EPTAS's for Load Balancing on Parallel Machines |
|
|
224 | (10) |
|
|
|
|
|
Weak Reduction Principle and Computable Metric Spaces |
|
|
234 | (10) |
|
|
|
|
|
Decidable and Undecidable Fragments of First-Order Concatenation Theory |
|
|
244 | (10) |
|
|
|
|
|
Algorithm Analysis Through Proof Complexity |
|
|
254 | (10) |
|
|
|
Computing with SAT Oracles: Past, Present and Future |
|
|
264 | (13) |
|
|
|
The Isometry Degree of a Computable Copy of p |
|
|
277 | (10) |
|
|
|
|
|
Algorithmic Statistics and Prediction for Polynomial Time-Bounded Algorithms |
|
|
287 | (10) |
|
|
|
A C.E. Weak Truth Table Degree Which Is Array Noncomputable and R-maximal |
|
|
297 | (10) |
|
|
|
The Complexity of Tukey Types and Cofinal Types |
|
|
307 | (11) |
|
|
|
Functionals of Type 3 as Realisers of Classical Theorems in Analysis |
|
|
318 | (10) |
|
|
|
Enumeration Degrees and Topology |
|
|
328 | (10) |
|
|
|
A Taxonomy of Deviant Encodings |
|
|
338 | (11) |
|
|
|
Elementary Bi-embeddability Spectra of Structures |
|
|
349 | (10) |
|
|
|
|
|
359 | (6) |
|
|
|
Some Nonstandard Equivalences in Reverse Mathematics |
|
|
365 | (11) |
|
|
|
Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs (Extended Abstract) |
|
|
376 | (10) |
|
|
|
|
|
What Is the Concept of Computation? |
|
|
386 | (11) |
|
|
|
Witness Hiding Without Extractors or Simulators |
|
|
397 | (13) |
|
|
|
|
|
|
|
|
|
Algorithms and Geometric Constructions |
|
|
410 | (11) |
|
|
|
|
|
Computing with Multisets: A Survey on Reaction Automata Theory |
|
|
421 | (12) |
|
|
|
|
| Author Index |
|
433 | |
Lisainfo e-raamatute kohta