Cs-Cc
Distributed XML Design
Classical and Quantum Annealing in the Median of Three Satisfiability
Symmetry of information and bounds on nonuniform randomness extraction via Kolmogorov extractors
A Survey of PPAD-Completeness for Computing Nash Equilibria
The tractability of CSP classes defined by forbidden patterns
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions
Maximal Spectral Efficiency of OFDM with Index Modulation under Polynomial Space Complexity
Rounding Semidefinite Programming Hierarchies via Global Correlation
Enforcing efficient equilibria in network design games via subsidies
On the Weak Computability of Continuous Real Functions
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model
On Minimal Constraint Networks
Solving the Closest Vector Problem with respect to l_p Norms
Evasiveness and the Distribution of Prime Numbers
A New Paradigm for Quantum Nonlocality
Lower Bounds for the Complexity of Monadic Second-Order Logic
The Power of Nondeterminism in Self-Assembly
Optimal measures and Markov transition kernels
Multivariate Polynomial Integration and Derivative Are Polynomial Time Inapproximable unless P=NP
Parallelism and Time in Hierarchical Self-Assembly
The Graph Isomorphism Problem and approximate categories
Quantum interactive proofs with weak error bounds
