A boundary between universality and non-universality in spiking neural P systems
A Casual Tour Around a Circuit Complexity Bound
A Combination of Testability and Decodability by Tensor Products
A comparison of Zeroes and Ones of a Boolean Polynomial
A Complete Characterization of Statistical Query Learning with Applications to Evolvability
A complexity dichotomy for hypergraph partition functions
A complexity dichotomy for partition functions with mixed signs
A Concrete View of Rule 110 Computation
A Counterexample to a Proposed Proof of P=NP by S. Gubin
A Counterexample to the Generalized Linial-Nisan Conjecture
A Critique of "Solving the P/NP Problem Under Intrinsic Uncertainty", arXiv:0811.0463
A Critique of a Polynomial-time SAT Solver Devised by Sergey Gubin
A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Non-negative Weights
A definable number which cannot be approximated algorithmically
A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
A dichotomy theorem for conservative general-valued CSPs
A Dichotomy Theorem for Polynomial Evaluation
A Dichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs
A direct product theorem for bounded-round public-coin randomized communication complexity
A direct sum theorem in communication complexity via message compression