Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

复杂性类 · Vinony

Home
Complexity classes
复杂性类

🌐中文

English Deutsch Español Français Italiano Nederlands Polski Português Svenska Русский العربية فارسی 한국어 中文日本語

EntityQ908207· pop 25· linked from 246 articles

复杂性类

Also known as computational complexity class

基於資源的複雜性相關的計算複雜性理論中的一系列問題

Available in 25 languages

Español
Français
Deutsch
中文
日本語
Русский
Português
Italiano
العربية
Catalan
Croatian

Connections

randomized algorithm

Arthur–Merlin protocol

Categories

Complexity classes Computational complexity theory Measures of complexity Theoretical computer science

Sources

wikipedia.externallinksexternallink

Norwegian Nynorsk

Show 6 more

Serbian (Latin)
simple
Svenska
zh_yue
فارسی
한국어

via Wikidata sitelinks · CC0

Turing machine

Entity

computational complexity theory

time complexity

polynomial-time reduction

interactive proof system

Monte Carlo algorithm

International Standard Book Number

Sign in to save

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Cobham's thesis

Entitydist 0.40

computational resource

Entitydist 0.41

algorithmic efficiency

Entitydist 0.44

algorithmic information theory

Entitydist 0.50

theory of computation

Entitydist 0.55

Grzegorczyk hierarchy

Entitydist 0.57

resource starvation

Entitydist 0.58

fair division problem

Entitydist 0.58

resource management

Entitydist 0.59

virtual organization

Entitydist 0.59

Entitydist 0.60

resource acquisition is initialization

Entitydist 0.60

What links here246 pages

probabilistically checkable proof

Alternating Turing machine

quantum complexity theory

description logic

proof of impossibility

Tutte polynomial

descriptive complexity theory

simply typed lambda calculus

computational complexity

boolean satisfiability problem

true quantified Boolean formula

Grzegorczyk hierarchy

P versus NP problem

computational resource

game complexity