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

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

Journal: Iranian Journal of Biotechnology 2020
Abdorreza Savadi, Babak Khorsand, Mahmoud Naghibzadeh,

Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...

متن کامل
Journal: :Algorithmica 2011

متن کامل
Journal: :Computational Geometry 2020

متن کامل
Journal: :Operations Research Letters 2008

متن کامل
Journal: :Foundations of Computational Mathematics 2019

متن کامل
Journal: :SIAM journal on mathematics of data science 2022

Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 5 January 2021Accepted: 30 August 2021Published online: 10 February 2022KeywordsWasserstein barycenters, optimal transport NP-hardness, inapproximability, computational complexity, curse dimensionalityAMS Subject Headings68Q17, 90C08Publication DataISSN (online): 2577-018...

متن کامل
Journal: :Discrete Applied Mathematics 1995

متن کامل
Journal: :International Journal of Computational Geometry & Applications 2016

متن کامل
Journal: :npj Quantum Information 2017

متن کامل
Journal: :Archive for Mathematical Logic 2009

متن کامل

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

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