Rod downey (40 Ergebnisse)

Hardcover. Zustand: Very Good. 1. Minimal shelf wear, clean internals. May have remainder mark.

25,5 x 17,5 cm. Zustand: Gut. 353-711 Pages Original Broschur in sehr gutem Zustand. Englische Sprache - Original Paperback in very good condition. English Language B10-02-03F|S74 Sprache: Englisch Gewicht in Gramm: 468.

25,5 x 17,5 cm. Zustand: Gut. 713-1064 Pages Original Broschur in sehr gutem Zustand. Innen wenige Seiten leicht knittrig. Englische Sprache - Original Paperback in very good condition. Inside few pages slightly creased. English Language B10-02-03F|S74 Sprache: Englisch Gewicht in Gramm: 445.

25,5 x 17,5 cm. Zustand: Gut. 1065-1416 Pages Original Broschur in sehr gutem Zustand. Englische Sprache - Original Paperback in very good condition. English Language B10-02-03F|S74 Sprache: Englisch Gewicht in Gramm: 454.

Zustand: Very Good. 62 pp., paperback, spine reinforced with tape, else very good. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.…

Zustand: New.

Zustand: New.

Zustand: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.…

Zustand: New.

hardcover. Zustand: Gut. 296 Seiten; 9780691199658.3 Gewicht in Gramm: 1.

Zustand: New. In English.

Paperback. Zustand: Brand New. 2012 edition. 528 pages. 9.25x6.10x1.19 inches. In Stock.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction.- Online Problems, Pathwidth, and Persistence.- Chordless Paths Through Three Vertices.- Computing Small Search Numbers in Linear Time.- Bounded Fixed-Parameter Tractability: The Case 2poly( k).- Refined Memorisation for Vertex Cover.- Parameterized Graph Separation Problems.- Parameterized Coloring Problems on Chordal Graphs.- On Decidability of MSO Theories of Representable Matroids.- On Miniaturized Problems in Parameterized Complexity Theory.- Smaller Kernels for Hitting Set Problems of Constant Arity.- Packing Edge Disjoint Triangles: A Parameterized View.- Looking at the Stars.- Moving Policies in Cyclic Assembly-Line Scheduling.- A Structural View on Parameterizing Problems: Distance from Triviality.- Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable.- Simplifying the Weft Hierarchy.- The Minimum Weight Triangulation Problem with Few Inner Points.- A Direct Algorithm for the Parameterized Face Cover Problem.- On Finding Short Resolution Refutations and Small Unsatisfiable Subsets.- Parameterized Algorithms for Feedback Vertex Set.- Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms.- Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments.- Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover.- Space and Time Complexity of Exact Algorithms: Some Open Problems.- Practical FPT Implementations and Applications. …

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Zustand: Brand New. 374 pages. 9.26x6.11x9.21 inches. In Stock.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This is a book about computation, something which is ubiquitous in the modern world. More precisely, it examines computability theory and computational complexity theory. Computability theory is the part of mathematics and computer science which seeks to clarify what we mean by computation or algorithm. When is there a computational solution possible to some question How can we show that none is possible How computationally hard is the question we are concerned with Arguably, this area lead to the development of digital computers. (Computational) complexity theory is an intellectual heir of computability theory. Complexity theory is concerned with understanding what resources are needed for computation, where typically we would measure the resources in terms of time and space. Can we perform some task in a feasible number of steps Can we perform some algorithm with only a limited memory Does randomness help Are there standard approaches to overcoming computational difficulty.…

Zustand: New. 2020. Paperback. . . . . . Books ship from the US and Ireland.

Taschenbuch. Zustand: Neu. Computability and Complexity | Foundations and Tools for Pursuing Scientific Applications | Rod Downey | Taschenbuch | Undergraduate Topics in Computer Science | xxviii | Englisch | 2024 | Springer | EAN 9783031537431 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Zustand: New. In English.

hardcover. Zustand: Acceptable. Damage on front cover.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Hardcover. Zustand: Brand New. 172 pages. 3.94x3.94x2.36 inches. In Stock.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Zustand: New. In English.

Paperback. Zustand: Brand New. 222 pages. 9.25x6.25x0.50 inches. In Stock.

Zustand: New. pp. vi + 172 Figures.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Hardcover. Zustand: Brand New. illustrated edition. 288 pages. 9.25x6.75x0.50 inches. In Stock.