Cs-Cc
Implicit complexity for coinductive data: a characterization of corecurrence
Local Rules for Computable Planar Tilings
Turing Machines and Understanding Computational Complexity
A PSPACE-Complete First Order Fragment of Computability Logic
Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime
Improved Approximation Lower Bounds for Vertex Cover on Power Law Graphs and Some Generalizations
The Dissecting Power of Regular Languages
On bilinear algorithms for multiplication in quaternion algebras
Finite and infinite basis in P and NP
Computational Complexity of Interactive Behaviors
A New Upper Bound for the Traveling Salesman Problem in Cubic Graphs
Entry times in automata with simple defect dynamics
On the intrinsic complexity of elimination problems in effective Algebraic Geometry
Strictly Temporally Periodic Points in Cellular Automata
Computational Aspects of Nearly Single-Peaked Electorates
Probabilistic verifiers for asymmetric debates
Intrinsic Simulations between Stochastic Cellular Automata
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
Solvability of HornSAT and CNFSAT
Classical simulations of Abelian-group normalizer circuits with intermediate measurements
Optimal Cuts and Bisections on the Real Line in Polynomial Time
Fooling sets and rank
