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.

RP · Vinony

🌐English

English Deutsch Français Italiano Nederlands Português Tiếng Việt Русский العربية 한국어 中文日本語

EntityQ1190846· pop 15· linked from 105 articles

RP

Also known as randomized polynomial time

complexity class

Available in 15 languages

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

Connections

P versus NP problem

Categories

Probabilistic complexity classes

Sources

wikipedia.externallinksexternallink

via Wikidata sitelinks · CC0

computational complexity theory

Entity

independent events

Michael O. Rabin

decision problem

regular language

complexity class

randomized algorithm

non-deterministic Turing machine

recursive language

probabilistic Turing machine

Sign in to save

Similar entities

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

Entitydist 0.28

Entitydist 0.35

polynomial hierarchy

Entitydist 0.40

Entitydist 0.40

Entitydist 0.41

Entitydist 0.42

Entitydist 0.43

Entitydist 0.43

Entitydist 0.43

list of complexity classes

Entitydist 0.43

computational complexity theory

Entitydist 0.44

Entitydist 0.46

What links here105 pages

complexity class

Arthur–Merlin protocol

probabilistically checkable proof

probabilistic Turing machine

P versus NP problem

boolean satisfiability problem

Grzegorczyk hierarchy

Las Vegas algorithm

regular language

chromatic polynomial