Cs-Cc
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
Approximating the diameter of a graph
Characterizing co-NL by a group action
Deciding the Winner of an Arbitrary Finite Poset Game is PSPACE-Complete
Distributions of Demmel and Related Condition Numbers
Hidden cliques and the certification of the restricted isometry property
Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem
Incidence Theorems and Their Applications
No Sublogarithmic-time Approximation Scheme for Bipartite Vertex Cover
On the Complexity of Equivalence of Specifications of Infinite Objects
