Cs-Cc
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
New results on stabbing segments with a polygon
NP-hardness of polytope M-matrix testing and related problems
On the Distribution of the Fourier Spectrum of Halfspaces
On the Hardness of Entropy Minimization and Related Problems
Optimization of Quadratic Forms: NP Hard Problems : Neural Networks
Parity and Streett Games with Costs
Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard
The Correct Exponent for the Gotsman-Linial Conjecture
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
The ODD EVEN DELTA problem is #P-hard
Transductions Computed by One-Dimensional Cellular Automata
Using Neighborhood Diversity to Solve Hard Problems
A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-
A PRG for Lipschitz Functions of Polynomials with Applications to Sparsest Cut
A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits
Algebraic Independence in Positive Characteristic -- A p-Adic Calculus
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
