Title of article
P=NP for some structures over the binary words
Author/Authors
Armin Hemmerling، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
22
From page
557
To page
578
Keywords
Computability over structures , computational complexity , complexity classes , Polynomial-timecomputability , P versus NP , Relativization
Journal title
Journal of Complexity
Serial Year
2005
Journal title
Journal of Complexity
Record number
292059
Link To Document