Cs-Cc
A Real World Mechanism for Testing Satisfiability in Polynomial Time
Unifying the Landscape of Cell-Probe Lower Bounds
General Ramified Recurrence is Sound for Polynomial Time
Beyond Language Equivalence on Visibly Pushdown Automata
Closures in Formal Languages and Kuratowskis Theorem
Spanning connectivity games
A New Lower Bound on Guard Placement for Wireless Localization
Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry
Negative Interactions in Irreversible Self-Assembly
How hard is it to approximate the Jones polynomial?
New worst upper bound for #SAT
Making Classical Ground State Spin Computing Fault-Tolerant
NP-completeness Proof: RBCDN Reduction Problem
On the complexity of the multiple stack TSP, kSTSP
A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
Communication Complexity
Is Computational Complexity a Barrier to Manipulation?
Adding a referee to an interconnection network: What can(not) be computed in one round
Min-Rank Conjecture for Log-Depth Circuits
On Tractable Exponential Sums
The surprizing complexity of generalized reachability games
Classical and Effective Descriptive Complexities of omega-Powers
