Title of article :
The set of the true regular protothetics formulas with partially ordered quantifiers is NEXPTIME-complete Original Research Article
Author/Authors :
Anatoly P. Beltiukov، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
Pages :
6
From page :
53
To page :
58
Abstract :
Nondeterministic exponential time complexity bounds are established for recognizing true propositional formulas with partially ordered quantifiers on propositional variables.
Keywords :
Computational complexity , Protothetics
Journal title :
Annals of Pure and Applied Logic
Serial Year :
2001
Journal title :
Annals of Pure and Applied Logic
Record number :
889813
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=889813
بازگشت