Natural Halting Probabilities, Partial Randomness, and Zeta Functions
NE is not NP Turing Reducible to Nonexpoentially Dense NP Sets
Near Quadratic Matrix Multiplication Modulo Composites
Near-Optimal Expanding Generating Sets for Solvable Permutation Groups
Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs
Nearly-Exponential Size Lower Bounds for Symbolic Quantifier Elimination Algorithms and OBDD-Based Proofs of Unsatisfiability
Negative Weights Make Unique Games Harder
New Applications of the Incompressibility Method: Part I
New Applications of the Incompressibility Method: Part II
New Choice for Small Universal Devices: Symport/Antiport P Systems
New Combinatorial Complete One-Way Functions
New Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length
New Definition for Fuzzy Constraint Satisfaction Problem and its Applications
New Hardness Results in Rainbow Connectivity
New Heuristic Rounding Approaches to the Quadratic Assignment Problem
New Learning and Testing Problems for Read-Once Functions
New Lower Bounds for Matching Vector Codes
New lower bounds for the border rank of matrix multiplication
New results on Noncommutative and Commutative Polynomial Identity Testing
New separation between $s(f)$ and $bs(f)$