Cs-Cc
Power Circuits, Exponential Algebra, and Time Complexity
Min CSP on Four Elements: Moving Beyond Submodularity
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC
Not Every Domain of a Plain Decompressor Contains the Domain of a Prefix-Free One
Non-negative Weighted #CSPs: An Effective Complexity Dichotomy
Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials
Categorical Tensor Network States
Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants
Block Sensitivity of Minterm-Transitive Functions
Image Characterization and Classification by Physical Complexity
Understanding the Quantum Computational Speed-up via De-quantisation
Constant Time Quantum search Algorithm Over A Datasets: An Experimental Study Using IBM Q Experience
Quantum Strategic Game Theory
Agnostic Learning of Monomials by Halfspaces is Hard
Loops under Strategies ... Continued
Finding of k in Fagins R. Theorem 24
Reducts of Ramsey structures
Backdoors to Tractable Answer-Set Programming
The problematic nature of potentially polynomial-time algorithms solving the subset-sum problem
Minimization for Generalized Boolean Formulas
Phase Transitions of Plan Modification in Conformant Planning
Tractable Set Constraints
