Cs-Cc
The Complexity of Reasoning for Fragments of Autoepistemic Logic
The Complexity Of The NP-Class
Constructing elliptic curve isogenies in quantum subexponential time
Computational Complexity Analysis of Simple Genetic Programming On Two Problems Modeling Isolated Program Semantics
A minimal nonfinitely based semigroup whose variety is polynomially recognizable
Model Checking CTL is Almost Always Inherently Sequential
Computational Complexity on Signed Numbers
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates
NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems
Quantum algorithms for formula evaluation
Circuit partitions and #P-complete products of inner products
Diviseurs de la forme 2D-G sans sections et rang de la multiplication dans les corps finis (Divisors of the form 2D-G without sections and bilinear complexity of multiplication in finite fields)
Generalized Satisfiability for the Description Logic ALC
Empirical Encounters with Computational Irreducibility and Unpredictability
New Hardness Results in Rainbow Connectivity
Preparing projected entangled pair states on a quantum computer
Counting dependent and independent strings
Spatial search in a honeycomb network
Proving the power of postselection
Decomposition Complexity
Finite state verifiers with constant randomness
The evaluation of geometric queries: constraint databases and quantifier elimination
