Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness

Polynomial time algorithm for 3-SAT. Examples of use

Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations

Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars

Polynomial-Space Approximation of No-Signaling Provers

Polynomial-time approximation scheme for Max-Cut problem

Polynomial-Time Multi-Selectivity

Polynomially Correlated Knapsack is NP-complete

Polyominoes Simulating Arbitrary-Neighborhood Zippers and Tilings

Possibilities and impossibilities in Kolmogorov complexity extraction

Preprocessing of Min Ones Problems: A Dichotomy

Private Data Release via Learning Thresholds

Probabilistic analysis of a differential equation for linear programming

Probabilistic and quantum finite automata with postselection

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