Search alternatives:
"NP-hard" » "NP-had", "NP-hand"

1
by Farago, Andras
Published 2021
MDPI - Multidisciplinary Digital Publishing Institute
Subjects: ...NP-hard...

2
by Calude, Cristian S.
Published 2022
MDPI - Multidisciplinary Digital Publishing Institute
Subjects: ...NP-hard...

3
by Stefano, Gabriele Di
Published 2022
MDPI - Multidisciplinary Digital Publishing Institute
Subjects: ...NP-hardness...

4
by Werner, Frank
Published 2020
MDPI - Multidisciplinary Digital Publishing Institute
Subjects: ...unary NP-hard...

5
by Werner, Frank
Published 2020
MDPI - Multidisciplinary Digital Publishing Institute
Subjects: ...NP-hard...

6
by Srivastava, Hari Mohan
Published 2022
MDPI - Multidisciplinary Digital Publishing Institute
Subjects: ...NP-hard problem...

7
by Gawiejnowicz, Stanisław
Published 2020
Springer Berlin Heidelberg
Table of Contents: ... -- Polynomial Parallel Machine Problems -- Polynomial Dedicated Machine Problems -- Part IV, NP-Hard Problems...

8
by Kreinovich, V., Lakeyev, A.V., Rohn, J., Kahl, P.T.
Published 1998
Springer US
Table of Contents: ... Dynamics -- 14 Engineering Corollary: Signal Processing is NP-Hard -- 15 Bright Sides of NP-Hardness...

9
by Fomin, Fedor V., Kratsch, Dieter
Published 2010
Springer Berlin Heidelberg
...Today most computer scientists believe that NP-hard problems cannot be solved by polynomial-time...

10
by Vourkas, Ioannis, Sirakoulis, Georgios Ch
Published 2016
Springer International Publishing
Table of Contents: ... -- Memristive Computing for NP-Hard AI Problems...

11
by Sperschneider, Volker
Published 2008
Springer Berlin Heidelberg
Table of Contents: ... -- Intelligent Data Structures -- NP-Hardness of Core Bioinformatics Problems -- Approximation Algorithms -- A...

12
by Izadkhah, Habib
Published 2022
Springer International Publishing
Table of Contents: ... -- Greedy Algorithms -- Graph -- Backtracking Algorithms -- P, NP, NP-Complete, and NP-Hard Problems...

13
by Ehrgott, Matthias
Published 2005
Springer Berlin Heidelberg
Table of Contents: ... -- Multiobjective Versions of Polynomially Solvable Problems -- Multiobjective Versions of Some NP-Hard Problems...

14
by Cai, Kai, Wonham, W. Murray
Published 2016
Springer International Publishing
Table of Contents: ... and Canonical Recognizer -- Appendix B NP-Hardness of Minimal-State Localization -- Appendix C Quasi-Congruence...

15
by Du, Ding-Zhu, Pardalos, Panos M., Hu, Xiaodong, Wu, Weili
Published 2022
Springer International Publishing
Table of Contents: .... Primal-Dual Methods and Minimum Cost Flow -- 8. NP-hard Problems and Approximation Algorithms -- 9...

16
Published 2020
Springer International Publishing
Table of Contents: ... systems -- Dynamical systems theory and algorithms for NP-hard problems...

17
by Lau, Lap Chi, Ravi, R., Singh, Mohit
Published 2011
Cambridge University Press
...With the advent of approximation algorithms for NP-hard combinatorial optimization problems...

18
by Williamson, David P., Shmoys, David Bernard
Published 2011
Cambridge University Press
... in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms...

19
Published 1980
Springer Berlin Heidelberg
Table of Contents: ... salesman problem using a one-arborescence relaxation -- Polynomial bounding for NP-hard problems -- Worst...

20
Published 2022
Springer International Publishing
Table of Contents: ... with Flowing Streams -- Vertex-to-Point Conflict-Free Chromatic Guarding is NP-hard -- The Polygon Burning...