Cs-Cc
On Expanded Cyclic Codes
Shallow Models for Non-Iterative Modal Logics
Lattice Problems, Gauge Functions and Parameterized Algorithms
Exhaustive enumeration unveils clustering and freezing in random 3-SAT
Towards a stable definition of Kolmogorov-Chaitin complexity
On Computing the Shadows and Slices of Polytopes
Universal Quantum Circuits
Adversary lower bounds for nonadaptive quantum algorithms
Wadge Degrees of Infinitary Rational Relations
P is a proper subset of NP
A Critique of a Polynomial-time SAT Solver Devised by Sergey Gubin
Generalized Modal Satisfiability
Nonlinear Optimization over a Weighted Independence System
A review of the Statistical Mechanics approach to Random Optimization Problems
To Broad-Match or Not to Broad-Match : An Auctioneers Dilemma ?
The complexity of planar graph choosability
Limit complexities revisited
Equivalent characterizations of partial randomness for a recursively enumerable real
Independence of P vs. NP in regards to oracle relativizations
Communication Efficiency in Self-stabilizing Silent Protocols
Secure Arithmetic Computation with No Honest Majority
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
