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.

true quantified Boolean formula · Vinony

🌐English

English Deutsch Español Français Italiano Português Türkçe 日本語

EntityQ1350285· pop 9· linked from 27 articles

true quantified Boolean formula

Also known as QSAT, TQBF, Quantified SAT

problem of deciding the satisfiability of a true quantified Boolean formula

Available in 9 languages

Español
Français
Deutsch
日本語
Português
Italiano
Hebrew
Türkçe

via Wikidata sitelinks · CC0

Connections

Categories

Boolean algebra PSPACE-complete problems Satisfiability problems

Sources

wikipedia.externallinksexternallink

NP-complete

Entity

polynomial hierarchy

free and bound variables

International Standard Book Number

digital object identifier

International Standard Serial Number

propositional calculus

formal language

computational complexity theory

universal quantification

time complexity

Sign in to save

What links here27 pages

polynomial hierarchy

Go and mathematics

Horn-satisfiability

Alternating Turing machine

2-satisfiability

Cook–Levin theorem

glossary of artificial intelligence

PSPACE-complete

Log-space reduction

context-sensitive grammar

boolean satisfiability problem

Similar entities

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

Cook–Levin theorem

Entitydist 0.44

Boolean algebra

Entitydist 0.51

Entitydist 0.54

quantization error

Entitydist 0.57

Entitydist 0.62

quantum complexity theory

Entitydist 0.67

Karp's 21 NP-complete problems

Entitydist 0.70

equivalent circuit

Entitydist 0.70

Entitydist 0.71

rxponential hierarchy

Entitydist 0.71

quantum Turing machine

Entitydist 0.71

Detective quantum efficiency

Entitydist 0.72