1
Published 1995
Springer Berlin Heidelberg
Table of Contents: ... -- Hardness of approximations -- Conclusions...

2
by Downey, Rodney G., Fellows, Michael R.
Published 2013
Springer London
Table of Contents: ... -- Part V: Hardness Theory -- Reductions -- TheBasic Class W[1] and an Analog of Cook's Theorem -- Other...

3
Published 2013
Springer Berlin Heidelberg
Table of Contents: ...Personal Tributes -- Computational Number Theory -- Hardness of Cryptographic Assumptions...

4
Published 2016
Springer International Publishing
Table of Contents: ... transmission regular graphs -- Color Spanning Objects: Algorithms and Hardness Results -- On Hamiltonian...

5
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...

6
Published 2011
Springer Berlin Heidelberg
... on approximation algorithms, hardness, algorithm engineering, computational geometry, string algorithms, and graph...

7
Published 2013
Springer International Publishing
Table of Contents: ....- The Jump Number Problem: Exact and Parameterized.- On the Hardness of Eliminating Small Induced Subgraphs...

8
Published 2005
Springer Berlin Heidelberg
Table of Contents: ... Distance in Circular Bacterial Genomes -- Using PQ Trees for Comparative Genomics -- Hardness of Optimal...

9
by Braverman, Mark, Yampolsky, Michael
Published 2009
Springer Berlin Heidelberg
... mathematical content. Computational hardness of Julia sets is the main subject of this book. By definition, a...

10
Published 2014
Springer International Publishing
Table of Contents: ...: Threshold-Coloring of Regular Lattices.- Classic Nintendo Games Are (Computationally) Hard...

11
by Bubley, Russ
Published 2001
Springer London
Table of Contents: ... Orientations -- 5.4 Totally Edge Cyclic Orientations -- 5.5 Independent Sets: The Conserved Hard-Core Model...

12
Published 2013
Springer Berlin Heidelberg
Table of Contents: ... Problem -- On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems -- Approximating...

13
Published 2019
Springer International Publishing
Table of Contents: ... and Hardness -- Wireless Communication -- Collaborative Broadcast in O(log log n) Rounds -- Multi-Channel...

14
Published 1975
Springer Netherlands
Table of Contents: ...Fundamentals of Computational Quantum Chemistry -- Fundamentals of Computer Hard- and Software...

15
by Cygan, Marek, Fomin, Fedor V., Kowalik, Łukasz, Lokshtanov, Daniel
Published 2015
Springer International Publishing
... of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds. All the results...

16
by Bürgisser, Peter
Published 2000
Springer Berlin Heidelberg
...-completeness in an entirely algebraic frame­ work, in connection with his famous hardness result...

17
Published 2018
Springer International Publishing
Table of Contents: ...The graph tessellation cover number: extremal bounds, efficient algorithms and hardness...

18
Published 1998
Springer Berlin Heidelberg
Table of Contents: ... Codes Based on Random Irregular Graphs -- Regular Papers -- Using Approximation Hardness to Achieve...

19
Published 2019
Springer International Publishing
Table of Contents: ... in Hybrid Communication Networks -- On the Approximability and Hardness of the Minimum Connected Dominating...

20
Published 2015
Springer Berlin Heidelberg
Table of Contents: ... with Advice -- Computing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Hard -- Improved...