A - B - C - D - E - F - G - H - I - J - K - L - M - N - O - P - Q - R - S - T - U - V - W - X - Y - Z

P

---

• P
• P versus BPP
• P vs. NP
• p-adic
• p-ary Transitive Reduction
• P-completeness
• p-isomorphism conjecture
• P-levelable
• P-selective
• P-separability
• P-separable
• P/poly
• PAC
• PAC learnability
• PAC learning
• PAC Learning DNF under Uniform with Membership Queries
• PAC Learning, DNF, Decision Trees
• PAC Learning, SQ-DIM, Amplification of Hardness
• PAC-learning
• PAC-Semantics
• packet routing
• packing
• packing number
• pairings
• Pairwise independence
• pairwise independent random variables
• pairwise independent random variables combinatorial design
• Pairwise Independent Sample Spaces
• Paley graphs
• parallel algorithm
• Parallel algorithms
• parallel complexity
• Parallel Composition
• parallel computation
• Parallel Computations
• Parallel Cryptography
• parallel graph algorithms
• parallel linear algebra
• Parallel Pointer Machines
• parallel prefix
• parallel processing
• parallel queries
• parallel random-access machine
• Parallel Repetition
• parallel testing
• parallel time complexity
• parallel time speedup
• parallelism
• Parallelization of Probabilistic Proof Systems
• Parameterization
• parameterized
• Parameterized algorithms
• Parameterized Complexity
• parameterized complexity theory
• Parameterized Inapproximability Hypothesis
• Parameterized Randomization
• parametric complexity
• Parametrized Complexity
• Parikh automata
• paris-harrington
• parities
• parity
• parity decision tree
• Parity decision tree complexity
• Parity Decision Trees
• parity functions
• Parity Games
• parity gate
• Parity Graphs
• parity nondeterminism
• parity with noise
• Parity-check matrix
• parity-learning
• Parralel Composition
• Parse Trees
• partial assignment
• partial boolean functions
• Partial Cube
• partial derivative
• Partial derivative matrix
• Partial derivatives
• partial designs
• Partial information
• partial k-trees
• Partial MCSP
• Partial orders
• partial polymorphisms
• Partial Randomness
• partial string
• partial word
• partially half-duplex communication complexity
• Partially Ordered Sets
• Partition bound
• partition number
• partitioned BDDs
• partitions
• Parvaresh-Vardy codes
• Path coupling
• Path Cover Problems
• path decompositions
• paths
• pathwidth
• pattern languages
• Pattern Matching
• pattern recognition
• pattern-tensor
• PCP
• PCP of Proximity
• PCP Theorem
• PCP, Argument Systems, CS Proofs
• PCP, Hardness of approximation, hyper graph coloring, short code
• PCP, Unique Games Conjecture, Hypergraph Coloring
• pcpp
• PCPPs
• PCPs
• PCPs of Proximity
• PCR
• Pebble Automata
• pebble game
• pebble games
• Pebbling
• pebbling contradiction
• pebbling formula
• pebbling formulas
• Pebbling games
• Perceptron
• percolation
• Perfect Code
• Perfect Completeness
• perfect concealing
• Perfect hash
• Perfect Hashing
• Perfect Matching
• perfect matching, maximum matching, NC
• perfect matchings
• perfect randomness
• perfect security
• perfect zero-knowledge
• Perfect Zero-Knowledge Proofs
• periodicity
• permanent
• Permanent estimators
• permanent, monomer-dimer
• permanents
• permutation branching programs
• permutation codes
• permutation constraints
• Permutation Function
• Permutation groups
• Permutation Invariance
• Permutations
• personalized equilibria
• pessimistic estimators
• pfaffian
• Pfaffian Activation Functions and Formulas
• pfaffian orientation
• PH
• phase transitions
• philosophy
• physical computation
• physics
• Pierce law
• pigeon hole principle
• pigeonhole formulas
• Pigeonhole Principle
• PIR writing
• PIT
• Places in function fields
• planar
• planar 3-connected graphs
• Planar Circuits
• Planar Digraphs
• planar directed graph
• planar graph
• Planar graph labelling
• Planar graph problems
• planar graphs
• Planar Instances
• planar reachability
• Planar Separator
• planar-embedded graphs
• Planarity
• Planarity Testing
• planarization
• planted clique
• PLS
• PLS-Completeness
• Poincaré inequalities
• Point lattices
• point location problems
• Point Spread Problem
• point-to-point communication
• pointer chasing
• pointer jumping
• Poissonization
• polar codes
• polarization
• Polarization Lemma
• polarizing transforms
• Polya's enumeration formula
• polylog-time reducibility
• polylog-time reductions
• Polymorphisms
• polymorpshisms
• Polynmial method
• polynoimial sources
• polynomial
• polynomial algorithm
• polynomial approximation
• polynomial approximations
• Polynomial Calculus
• polynomial calculus resolution
• Polynomial Degree
• polynomial degree of Boolean functions
• polynomial equations
• Polynomial Equivalence
• polynomial evaluation
• Polynomial Factoring
• polynomial factorization
• polynomial factorization, non-commutative arithmetic circuits
• polynomial freiman ruzsa
• polynomial Freiman Ruzsa Conjecture
• polynomial Freiman-Ruzsa conjecture
• polynomial gap
• Polynomial Hierachy
• Polynomial hierarachy
• polynomial hierarchy
• Polynomial Identities
• polynomial identity testing
• polynomial interpolation
• Polynomial Itdentity Testing
• Polynomial Local Search
• Polynomial matrix
• polynomial method
• polynomial multiplication
• polynomial projection
• Polynomial Reconstruction
• polynomial reducibilities
• polynomial reductions
• polynomial regression
• Polynomial Representations
• polynomial representations of Boolean functions
• polynomial size circuit
• polynomial sources
• polynomial space
• polynomial summation
• polynomial test
• Polynomial threshold functions
• polynomial time
• polynomial time algorithm
• Polynomial Time Algorithms
• Polynomial Time Approximation Schemes
• polynomial time computable distributions
• polynomial time many-one reductions
• polynomial time recognition
• polynomial vs. exponential weights
• polynomial-map
• polynomial-size circuits
• polynomial-time
• polynomial-time computable curve
• polynomial-time hierarchy
• polynomial-time many-one completeness
• polynomial-time reasoning
• Polynomial-time reductions
• polynomial-time samplable distributions
• polynomialadvice
• polynomialcalculus
• polynomialidentity testing
• polynomials
• polynomials over reals
• polynomials over Z_6
• polytope
• polytopes
• Poset games
• Posets
• Positive Definite
• Positive Definite Linear Systems
• positive-reliable learning
• Positivstellensatz
• Post's lattice
• Post-quantum cryptography
• post-quantum security
• postselection
• Potential Analysis
• power iteration
• Power Symmetric Polynomials
• powers
• pp
• PP/poly
• PPA-Completeness
• PPAD
• PPAD-complete
• PPAD-Completeness
• PPP
• PPSZ
• PRAM
• PRAM Complexity
• PRAMs
• precedence graph
• Predecessor Search
• Prediction
• predictive complexity
• preference games
• prefix circuits
• prefix complexity
• prefix sum
• Preparata
• preprocessing
• Presburger arithmetic
• PRG
• pricing
• primal-dual
• Primal-Dual Relaxation
• Primality
• primality proving
• Prime $k$-tuplet conjecture
• prime implicant
• prime implicants
• prime implicate
• Prime Numbers
• prime-power
• primes
• primitive group
• primitive recursion
• primitive root
• Principal Minor
• Priority algorithms
• Priority Queue
• priority queues
• priority sampling
• privacy
• Privacy amplification
• private alternation
• Private approximation
• Private computation
• private information retrieval
• Private Information Retrival
• Private InformationRetrieval
• Private key Cryptography
• private randomness
• Private Simultaneous Messages
• Private-key
• probabilisitic checking of proofs (PCP)
• Probabilism versus Determinism
• Probabilistic Communication Protocols
• Probabilistic algorithm
• Probabilistic Algorithms
• Probabilistic Analysis
• probabilistic and quantum computation
• probabilistic arguments
• probabilistic automata
• Probabilistic branching programs
• Probabilistic Checkable Proofs
• Probabilistic Checking of Proofs
• probabilistic classes
• Probabilistic Communication Complexity
• Probabilistic Complexity Classes
• probabilistic computation
• Probabilistic Computations
• probabilistic counting
• Probabilistic degree
• probabilistic encryption with errors
• probabilistic finite automata
• probabilistic inference
• probabilistic Kolmogorov complexity
• probabilistic machines
• Probabilistic Method
• probabilistic networks
• probabilistic polynomial
• probabilistic polynomial time
• Probabilistic polynomial-time
• Probabilistic Proof Systems
• probabilistic time
• probabilistic Turing machine
• probabilistically checkable proofs
• probabilistically checkable proofs
• Probabilistically Checkable Debates
• Probabilistically checkable proof
• probabilistically checkable proof (PCP)
• Probabilistically Checkable Proofs
• Probabilistically Checkable Proofs (PCP)
• probabilistically exact learning
• probabilisticcheckable proofs (PCP)
• Probabilitically Checkable Proofs
• probability
• Probability distributions
• Probabilstic Complexity Classes
• problem kernel
• problem-dependent commitments
• Product Code
• Product distributions
• product test
• program checking
• program constructors
• program verification
• Programs over Monoids
• Projected Shifted Partials
• projection games
• projection of determinant
• projection reductions
• projection rule
• projections
• Projective Dimension
• Projective Planes
• Promise Classes
• Promise Majority
• promise problems
• proof
• Proof Complexity
• proof complexity generators
• proof complexity, Godel's Incompleteness theorem, exponential time
• proof composition
• proof of knowledge
• Proof of Retrievability
• proof search
• Proof size
• proof space
• Proof System
• proof systems
• proof-length
• proofs of knowledge
• Proofs of Proximity
• proofs versus arguments
• proper learning
• property
• Property reconstruction
• Property Testing
• property testing, affine invariance, lower bounds
• Property testing, probability distributions,
• Property testing, query lower bound, Boolean functions
• propositional calculus
• propositional logic
• Propositional model counting
• propositional pigeonhole principle
• propositional proof
• propositional proof complexity
• Propositional Proof System
• propositional proof systems
• propositional proof-systems
• propositional proofs
• propositional satisfiability
• Propositional-calculus
• propositionalproof system
• Protein and Gene Networks
• protocol composition
• protocol compression
• provable security
• prover delayer game
• Prover-Delayer Game
• Prover-Delayer Games
• Proximity Oblivious Testers
• proximity testing
• pseudo randomness
• pseudo-deterministic
• Pseudo-deterministic NC
• pseudo-dimension
• pseudo-entropy pair
• pseudo-free family of finite computational groups
• Pseudo-Random Function
• Pseudo-Random Functions
• pseudo-random generator
• Pseudo-Random Generators
• pseudo-random number generator
• pseudo-random polynomial families
• Pseudo-Random Sets
• Pseudo-Randomness
• pseudobinomiality
• pseudodeterminism
• Pseudodeterministic algorithms
• pseudoentropy
• pseudorandom
• pseudorandom function
• pseudorandom function (PRF)
• pseudorandom functions
• Pseudorandom generaors
• pseudorandom generator
• Pseudorandom generator construction
• pseudorandom generators
• pseudorandom generators (PRGs)
• pseudorandom generators for small-space computation
• pseudorandom generators for space-bounded computation
• pseudorandom pseudodistributions
• pseudorandomgenerator
• PseudorandomGenerators
• Pseudorandomness
• PSL(2
• PSPACE
• PSPACE complete
• PSPACE-complete
• PSPACE-completeness
• PSPACE-hardness
• psudorandomness
• PTAS
• PTF circuits
• PTF gates
• public coin
• Public Key Cryptography
• public key encryption
• public randomness
• public vs private coins
• Public-Key
• Public-Key Cryptography
• public-key cryptosystem
• public-key cryptosystems
• public-key encryption
• Public-key Encryption Schemes
• Puncturing
• pure Nash equilibrium
• push down automata
• pushdown automata
• Puzzle
• puzzles
• P^{NP[1]}=P^{NP[2]}

---

ISSN 1433-8092 | Imprint