نتایج جستجو برای: hard np

تعداد نتایج: 172283  

Journal: :Journal of Graph Algorithms and Applications 2012

Journal: :SciPost physics 2023

Several physically inspired problems have been proven undecidable; examples are the spectral gap problem and membership for quantum correlations. Most of these results rely on reductions from a handful undecidable problems, such as halting problem, tiling Post correspondence or matrix mortality problem. All common property: they an NP-hard bounded version. This work establishes relation between...

Journal: :Journal of Combinatorial Theory, Series B 1991

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید