Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

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

P · Vinony

EntityQ846354· pop 28· linked from 558 articles

P

Sign in to save

computational complexity class of problems

Connections

computational complexity theory

time complexity

polynomial hierarchy

International Standard Book Number

digital object identifier

formal language

linear programming

Stanford Encyclopedia of Philosophy

P versus NP problem

first-order logic

Michael O. Rabin

Categories

Complexity classes

Sources

wikipedia.externallinksexternallink

What links here558 pages

boolean satisfiability problem

regular language

formal language

descriptive complexity theory

lambda calculus

Savitch's theorem

compactness theorem

axiomatic system

Arthur–Merlin protocol

Mostowski collapse lemma

Michael O. Rabin

algebra of sets

computer-assisted proof

continuum hypothesis

Similar entities

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

computational complexity theory

Entitydist 0.24

Entitydist 0.28

Entitydist 0.30

Entitydist 0.32

Entitydist 0.32

Entitydist 0.33

computational hardness assumption

Entitydist 0.34

polynomial hierarchy

Entitydist 0.34

Entitydist 0.36

Entitydist 0.37

Category:Theorems in computational complexity theory

Entitydist 0.37

Entitydist 0.37