Cs-Cc
Complexity of the conditional colorability of graphs
New Choice for Small Universal Devices: Symport/Antiport P Systems
Colouring graphs with constraints on connectivity
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
On acceptance conditions for membrane systems: characterisations of L and NL
Deductive Inference for the Interiors and Exteriors of Horn Theories
A polynomial-time algorithm for estimating the partition function of the ferromagnetic Ising model on a regular matroid
Schaefers theorem for graphs
Faster p-adic Feasibility for Certain Multivariate Sparse Polynomials
Towards a communication-theoretic understanding of system-level power consumption
A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report)
Computational Difficulty of Computing the Density of States
Proof of Concept: Fast Solutions to NP-problems by Using SAT and Integer Programming Solvers
Quantum computation with devices whose contents are never read
The Complexity of Weighted Boolean #CSP
Pebbling and Branching Programs Solving the Tree Evaluation Problem
Geometric Complexity Theory and Tensor Rank
Exploring the Limits of GPUs With Parallel Graph Algorithms
Sorting by Transpositions is Difficult
Quantum Online Memory Checking
Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs
