Uniform test of algorithmic randomness over a general space

Universal Computation is 'Almost Surely' Chaotic

Universal Quantum Circuits

Unpredictability and Computational Irreducibility

Using a Skewed Hamming Distance to Speed Up Deterministic Local Search

Using Elimination Theory to construct Rigid Matrices

Using Kolmogorov Complexity for Understanding Some Limitations on Steganography

Using the No-Search Easy-Hard Technique for Downward Collapse

Variations on Muchnik's Conditional Complexity Theorem

Variety Evasive Sets

Various complexity results for computational mass spectrometry problems

Vertex Cover Problem Parameterized Above and Below Tight Bounds

VPSPACE and a transfer theorem over the complex field

VPSPACE and a Transfer Theorem over the Reals

Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion

What makes normalized weighted satisfiability tractable

Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time

Why Philosophers Should Care About Computational Complexity

Width-parameterized SAT: Time-Space Tradeoffs

Zen Puzzle Garden is NP-complete