مرکز منطقه ای اطلاع رساني علوم و فناوري - Complexity versus stability for classes of propositional formulas

Title of article :

Complexity versus stability for classes of propositional formulas

Author/Authors :

Nadia Creignou، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 1998

Pages :

From page :

161

To page :

165

Keywords :

XOR-CNF formulas , computational complexity , coNP-completeness , Horn formulas , Equivalence of formulas , 2CNF formulas

Journal title :

Information Processing Letters

Serial Year :

1998

Journal title :

Information Processing Letters

Record number :

128981

Link To Document :