Cs-Cc
Kolmogorov Complexity Theory over the Reals
Clusters of solutions and replica symmetry breaking in random k-satisfiability
On Termination for Faulty Channel Machines
On the Complexity of Elementary Modal Logics
Topological Dynamics of Cellular Automata: Dimension Matters
Solving the P/NP Problem under Intrinsic Uncertainty
A polytime proof of correctness of the Rabin-Miller algorithm from Fermats little theorem
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
Kaltofens division-free determinant algorithm differentiated for matrix adjoint computation
Three New Complexity Results for Resource Allocation Problems
Constraint satisfaction problems with isolated solutions are hard
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages
Equilibria, Fixed Points, and Complexity Classes
SAT Has No Wizards
Recursive Concurrent Stochastic Games
P is not equal to NP
Reduced Kronecker coefficients and counter-examples to Mulmuleys strong saturation conjecture SH
The Pursuit of Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings
Divisibility, Smoothness and Cryptographic Applications
Approximate kernel clustering
On models of a nondeterministic computation
Quantum algorithms for highly non-linear Boolean functions
