m-sophistication

Making the long code shorter, with applications to the Unique Games Conjecture

Many-one reductions between search problems

Mastermind is NP-Complete

Mathematical basis for polySAT implication operator

Matrix P-norms are NP-hard to approximate if p \neq 1,2,\infty

Matrix sparsification and the sparse null space problem

Maximum Bounded Rooted-Tree Packing Problem

Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard

Meaningful Information

Measuring communication complexity using instance complexity with oracles

Merkle Puzzles are Optimal

Method of resolution of 3SAT in polynomial time

Min CSP on Four Elements: Moving Beyond Submodularity

Min-Rank Conjecture for Log-Depth Circuits

Minimal DFAs for Testing Divisibility

Minimization for Generalized Boolean Formulas

Minimizing Communication in Linear Algebra

Model Checking Positive Equality-free FO: Boolean Structures and Digraphs of Size Three

Modular difference logic is hard