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)$

Noise vs computational intractability in dynamics

Non-Deterministic Communication Complexity of Regular Languages

Non-monotone submodular maximization under matroid and knapsack constraints

Non-negative Weighted #CSPs: An Effective Complexity Dichotomy

Nonapproximablity of the Normalized Information Distance

Noncommutative Martin-Lof randomness : on the concept of a random sequence of qubits

Nondeterministic Quantum Query and Quantum Communication Complexities

Normalized Information Distance is Not Semicomputable

Note on Counting Eulerian Circuits

Note on the complexity of deciding the rainbow connectedness for bipartite graphs

NP by means of lifts and shadows

NP has log-space verifiers with fixed-size public quantum registers

NP is not AL and P is not NC is not NL is not L

NP-completeness Proof: RBCDN Reduction Problem

NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs