Downey rod (116 Ergebnisse)

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.

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

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: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: New. 2024th edition NO-PA16APR2015-KAP.

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.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

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

Zustand: New.

Zustand: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Paperback. Zustand: New. Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications in topology, group theory, and other subfields.In A Hierarchy of Turing Degrees, Rod Downey and Noam Greenberg introduce a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. Downey and Greenberg present numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers.Blending traditional and modern research results in computability theory, A Hierarchy of Turing Degrees establishes novel directions in the field.…

Zustand: As New. Unread book in perfect condition.

Zustand: New. 2020. Paperback. . . . . .

Paperback. Zustand: New. Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications in topology, group theory, and other subfields.In A Hierarchy of Turing Degrees, Rod Downey and Noam Greenberg introduce a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. Downey and Greenberg present numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers.Blending traditional and modern research results in computability theory, A Hierarchy of Turing Degrees establishes novel directions in the field.…

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