Cs-Cc
The Complexity of Proving Chaoticity and the Church-Turing Thesis
A tight bound on the worst-case number of comparisons for Floyds heap construction algorithm
Quantum rejection sampling
A Solution of the P versus NP Problem based on specific property of clique function
Solving the Rural Postman problem using the Adleman-Lipton model
Monotonic and Non-Monotonic Solution Concepts for Generalized Circuits
Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems
Near NP-Completeness for Detecting p-adic Rational Roots in One Variable
Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix
On a Certain NP-Complete Problem
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
Timeline-based planning: Expressiveness and Complexity
The Two Bicliques Problem is in NP intersection coNP
Arithmetic complexity via effective names for random sequences
Dense locally testable codes cannot have constant rate and distance
Does Treewidth Help in Modal Satisfiability?
Infinite Time Cellular Automata: A Real Computation Model
Multiply-Recursive Upper Bounds with Higmans Lemma
The Complexity of Approximately Counting Stable Roommate Assignments
Hypergraph matching for MU-MIMO user grouping in wireless LANs
Logical complexity of graphs: a survey
Multicolored Dynamos on Toroidal Meshes
