Computational complexity

Ningún artículo

P versus np problem Np complete Np complexity P complexity R complexity Polynomial hierarchy Exponential hierarchy Polynomial time Exponential time Cooks theorem Time hierarchy theorem Space hierarchy theorem Boolean satisfiability problem True quantified boolean formula Counting problem complexity Interactive proof system Natural proof Time complexity Space complexity P vs np Np completeness Assignment problem Cnf sat Collision problem Constraint satisfaction Exact cover Stable matching problem Subgraph isomorphism problem Subset sum problem Traveling salesman problem Parameterized approximation algorithm Padding argument Aanderaa karp rosenberg conjecture Analysis of algorithms Approximation algorithm Asymptotic computational complexity Averaging argument Best worst and average case Boolean circuit Circuit complexity Claw finding problem Cobhams thesis Communication complexity Computation tree Computational complexity of mathematical operations Computational complexity of matrix multiplication Configuration graph Computational resource Computing the permanent Decision tree model Existential theory of the reals Gap hamming problem Generic case complexity Geometric complexity theory Graph isomorphism problem Hamiltonian complexity Hardness of approximation Hartmanis stearns conjecture Information based complexity Log rank conjecture Parameterized complexity Pebble game Pseudo polynomial transformation Quasi polynomial growth Smoothed analysis Strong np completeness Switching lemma Tractable problem Unique games conjecture Weak np completeness Yaos principle Circuit computer science Big o notation

Todavía no hay artículos en esta categoría — están en camino.