نتایج جستجو برای: hard np
تعداد نتایج: 172283 فیلتر نتایج به سال:
Journal:
:Journal of Graph Algorithms and Applications
2012
Journal:
:Information and Computation
2005
Journal:
:Theoretical Computer Science
2007
Journal:
:BMC Bioinformatics
2013
Journal:
:Discrete Applied Mathematics
1985
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
Journal:
:Computational Geometry
2008
Journal:
:Discrete Applied Mathematics
2020
Journal:
:Logistics & Sustainable Transport
2015
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید