نتایج جستجو برای: np complete problem
تعداد نتایج: 1212329 فیلتر نتایج به سال:
Journal:
:Discrete Applied Mathematics
1996
Tibor Hegedüs
Nimrod Megiddo
We investigate the complexity of the MEMBERSHIP problem for some geometrically deened classes of Boolean functions, i.e., the complexity of deciding whether a Boolean function given in DNF belongs to the class. We give a general argument implying that this problem is co-NP-hard for any class having some rather benign closure properties. Applying this result we show that the MEMBERSHIP problem i...
Journal:
:Discrete Applied Mathematics
2001
Journal:
:Economic Theory
2004
Journal:
:Proceedings of the National Academy of Sciences
2011
Journal:
:Theory of Computing Systems
2008
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید