نتایج جستجو برای: np
تعداد نتایج: 40375 فیلتر نتایج به سال:
2006
Christian Glaßer
Alan L. Selman
Samik Sengupta
Liyu Zhang
We study the question of whether the class DisjNP of disjoint pairs (A,B) of NPsets contains a complete pair. The question relates to the question of whether optimal proof systems exist, and we relate it to the previously studied question of whether there exists a disjoint pair of NP-sets that is NP-hard. We show under reasonable hypotheses that nonsymmetric disjoint NP-pairs exist, which provi...
Journal:
:Baltic International Yearbook of Cognition, Logic and Communication
2010
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید