Movatterモバイル変換

Jump to content

Category:Computational complexity theory

From Wikipedia, the free encyclopedia

Wikimedia Commons has media related toComputational complexity theory.

The main article for thiscategory isComputational complexity theory.

Subcategories

This category has the following 14 subcategories, out of 14 total.

A

Analysis of algorithms(4 C, 47 P)

C

Circuit complexity(20 P)
Complexity classes(1 C, 96 P)
Computational hardness assumptions(26 P)
Computational problems(12 C, 31 P)
Computational resources(13 P)

D

Descriptive complexity(9 P)

M

Measures of complexity(1 C, 14 P)

P

Parameterized complexity(1 C, 7 P)

Q

Quantum complexity theory(19 P)
Quantum computing(4 C, 110 P)

R

Reduction (complexity)(19 P)

S

Structural complexity theory(2 C, 17 P)

T

Theorems in computational complexity theory(24 P)

Pages in category "Computational complexity theory"

The following 111 pages are in this category, out of 111 total.This list may not reflect recent changes.

Computational complexity theory

*

A

B

C

D

E

F

Folded Reed–Solomon code

G

H

I

K

L

M

Model of computation

N

P

Q

R

S

T

U

W

Weak NP-completeness

Y

Yao's principle

Retrieved from "https://en.wikipedia.org/w/index.php?title=Category:Computational_complexity_theory&oldid=1153728911"

Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp