Title of article :
Languages represented by Boolean formulas
Author/Authors :
Helmut Veith، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1997
Pages :
6
From page :
251
To page :
256
Keywords :
Descriptive complexity theory , Succinct problems , Propositional logic , computational complexity
Journal title :
Information Processing Letters
Serial Year :
1997
Journal title :
Information Processing Letters
Record number :
128749
Link To Document :
بازگشت