True quantified Boolean formula

True quantified Boolean formula

In computational complexity theory, the language TQBF is a formal language consisting of the true quantified Boolean formulas. A (fully) quantified Boolean formula is a formula in quantified propositional logic where every variable is quantified (or bound), using either existential or universal quantifiers, at the beginning of the sentence. Such a formula is equivalent to either true or false (since there are no free variables). If such a formula evaluates to true, then that formula is in the language TQBF. It is also known as QSAT (Quantified SAT).
language
http://dbpedia.org/resource/True_quantified_Boolean_formula

True quantified Boolean formula

In computational complexity theory, the language TQBF is a formal language consisting of the true quantified Boolean formulas. A (fully) quantified Boolean formula is a formula in quantified propositional logic where every variable is quantified (or bound), using either existential or universal quantifiers, at the beginning of the sentence. Such a formula is equivalent to either true or false (since there are no free variables). If such a formula evaluates to true, then that formula is in the language TQBF. It is also known as QSAT (Quantified SAT).
language
http://dbpedia.org/resource/True_quantified_Boolean_formula
has abstract
Em teoria da complexidade comp ...... da como QSAT (Quantified SAT).
@pt
En théorie de la complexité, e ...... me QBF-SAT est PSPACE-complet.
@fr
In computational complexity th ...... nown as QSAT (Quantified SAT).
@en
Una fórmula booleana cuantific ...... ntificado). * Datos: Q1350285
@es
計算複雑性理論において、言語TQBFは量化された真のブール式 ...... AT, Quantified SAT)としても知られている。
@ja
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
Em teoria da complexidade comp ...... da como QSAT (Quantified SAT).
@pt
En théorie de la complexité, e ...... me QBF-SAT est PSPACE-complet.
@fr
In computational complexity th ...... nown as QSAT (Quantified SAT).
@en
Una fórmula booleana cuantific ...... e la forma: * Datos: Q1350285
@es
計算複雑性理論において、言語TQBFは量化された真のブール式 ...... AT, Quantified SAT)としても知られている。
@ja
label
Erfüllbarkeitsproblem für quantifizierte boolesche Formeln
@de
Formule booléenne quantifiée
@fr
Fórmula booleana cuantificada verdadera
@es
Fórmula booliana completamente quantificada
@pt
TQBF問題
@ja
True quantified Boolean formula
@en
sameAs
wasDerivedFrom
isPrimaryTopicOf