Cs-Cc
Towards the Notion of an Abstract Quantum Automaton
Computing Multiplicities of Lie Group Representations
The Complexity of the Puzzles of Final Fantasy XIII-2
The computational hardness of counting in two-spin models on d-regular graphs
Tight Cell-Probe Bounds for Online Hamming Distance Computation
Reduction from non-injective hidden shift problem to injective hidden shift problem
NP-Hardness of optimizing the sum of Rational Linear Functions over an Asymptotic-Linear-Program
Lower Error Bounds for Randomized Multilevel and Changing Dimension Algorithms
Quantum Fourier Transforms and the Complexity of Link Invariants for Quantum Doubles of Finite Groups
A fast parallel algorithm for minimum-cost small integral flows
A pair of universal sequence-set betting strategies
Adversary Lower Bound for the k-sum Problem
Almost Optimal Explicit Johnson-Lindenstrauss Transformations
Balanced K-SAT and Biased random K-SAT on trees
Combinatorial Spaces And Order Topologies
Even faster integer multiplication
Explicit tensors of border rank at least 2n-1
Extension of cellular automata by introducing an algorithm of recursive estimation of neighbors
Fixed Parameter Undecidability for Wang Tilesets
Near-Optimal Deterministic Algorithms for Volume Computation and Lattice Problems via M-Ellipsoids
New lower bounds for the rank of matrix multiplication
New NP-hardness results for 3-Coloring and 2-to-1 Label Cover
