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.

SL · Vinony

🌐English

English Español Français Italiano Nederlands Português العربية 中文日本語

EntityQ6138961· pop 6· linked from 95 articles

SL

Also known as co-SL

complexity class of problems log-space reducible to USTCON

Available in 6 languages

Español
日本語
Português
العربية
Catalan

via Wikidata sitelinks · CC0

Connections

Christos Papadimitriou

Log-space reduction

Categories

Complexity classes

Sources

wikipedia.externallinksexternallink
Wikidata (CC0)wikidata-claims
Pixabayimage-pixabay

International Standard Book Number

Entity

digital object identifier

depth-first search

breadth-first search

computational complexity theory

Richard M. Karp

László Lovász

bipartite graph

Sign in to save

Similar entities

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

Entitydist 0.45

Entitydist 0.46

polynomial hierarchy

Entitydist 0.54

Entitydist 0.54

Entitydist 0.57

Category:Theorems in computational complexity theory

Entitydist 0.57

Entitydist 0.58

Entitydist 0.58

PSPACE-complete

Entitydist 0.58

Entitydist 0.58

computational hardness assumption

Entitydist 0.58

Entitydist 0.59

What links here95 pages

Symmetric Turing machine

Arthur–Merlin protocol

probabilistically checkable proof

Richard J. Lipton

Grzegorczyk hierarchy

P versus NP problem

boolean satisfiability problem

regular language

connected component of a graph

complexity class

st-connectivity

computable function