Search alternatives:
"NP-hard" » "NP-had", "NP-hand"
Cover Image
Read Now

1
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...”
Cover Image
Read Now

2
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...”
Cover Image
Read Now

3
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...”
Cover Image
Read Now

4
Published 2020
Springer International Publishing
Table of Contents: “... Paths -- Four shorts stories on surprising algorithmic uses of treewidth -- Algorithms for NP-Hard...”
Cover Image
Read Now

5
Published 1998
Springer Berlin Heidelberg
Table of Contents: “... -- On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems -- Quadratic...”
Cover Image
Read Now

6
Published 2014
Springer International Publishing
Table of Contents: “... with Respect to Politicians’ Egos -- Being Negative Makes Life NP-hard (for Product Sellers).- Clearing...”
Cover Image
Read Now

7
Published 2012
Springer Berlin Heidelberg
Table of Contents: “... -- Mortality for 2 × 2 Matrices Is NP-Hard -- Solving Counter Parity Games -- Drawing Planar Graphs on Points...”
Cover Image
Read Now

8
Published 2009
Springer Berlin Heidelberg
Table of Contents: “... is NP-Hard -- On the Computational Complexity of Monotone Constraint Satisfaction Problems...”
Cover Image
Read Now

9
Published 2017
Springer International Publishing
Table of Contents: “....- Computing Heegaard Genus Is NP-Hard: David Bachman, Ryan Derby-Talbot, and Eric Sedgwick.- Approximation...”
Cover Image
Read Now

10
Published 2014
Springer Berlin Heidelberg
Table of Contents: “... Codes -- Minimum Bisection is NP-hard on Unit Disk Graphs -- Query-Competitive Algorithms for Cheapest...”
Cover Image
Read Now

11
Published 2013
Springer Berlin Heidelberg
Table of Contents: “... Problem -- On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems -- Approximating...”
Cover Image
Read Now

12
Published 2017
Springer International Publishing
Table of Contents: “... search using multi-objective optimization -- The multi-objective shortest path problem is NP-hard...”
Cover Image
Read Now

13
Published 2015
Springer Berlin Heidelberg
Table of Contents: “... -- Binary Pattern Tile Set Synthesis Is NP-Hard -- Near-Optimal Upper Bound on Fourier Dimension of Boolean...”