Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_2$

Parameterized Control Complexity in Fallback Voting

Parameterized Intractability of Motif Search Problems

Parameterized Two-Player Nash Equilibrium

Partial Degree Bounded Edge Packing Problem

Partial randomness and dimension of recursively enumerable reals

Partition Arguments in Multiparty Communication Complexity

Partitionability to two trees is NP-complete

Passively Mobile Communicating Machines that Use Restricted Space

Pebbles and Branching Programs for Tree Evaluation

Pebbling and Branching Programs Solving the Tree Evaluation Problem

Perfect Phylogeny Haplotyping is Complete for Logspace

Phase transition and computational complexity in a stochastic prime number generator

Phase transition in the assignment problem for random matrices

Phase Transition in Unrestricted Random SAT

Phase Transitions and all that

Phutball Endgames are Hard

Physical portrayal of computational complexity

Planar Graphs: Logical Complexity and Parallel Isomorphism Tests

Planarity Testing Revisited