Probabilistic communication complexity over the reals
Probabilistic Reversible Automata and Quantum Automata
Proceedings CSR 2010 Workshop on High Productivity Computations
Proceedings Fourth Athens Colloquium on Algorithms and Complexity
Proceedings International Workshop on The Complexity of Simple Programs
Proceedings Seventh International Conference on Computability and Complexity in Analysis
Product theorems via semidefinite programming
Program Size and Temperature in Self-Assembly
Program-Size Versus Time Complexity, Speed-Up and Slowdown Phenomena in Small Turing Machines
Properties of Pseudo-Primitive Words and their Applications
Proving that P is not equal to NP and that P is not equal to the intersection of NP and co-NP
Proving the power of postselection
Pseudorandom generators and the BQP vs. PH problem
Pseudorandom Generators for Polynomial Threshold Functions
Pseudorandomness and Combinatorial Constructions
PSPACE has 2-round quantum interactive proof systems
PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation
QCSP on partially reflexive forests
Quantifying Resource Use in Computations
Quantum Arthur-Merlin Games