Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 75,47
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New.
EUR 77,97
Cantidad disponible: 1 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
EUR 73,17
Cantidad disponible: 1 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 83,68
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 73,14
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 84,18
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Springer, Springer International Publishing Mai 2025, 2025
ISBN 10: 3031929314 ISBN 13: 9783031929311
Librería: Rheinberg-Buch Andreas Meier eK, Bergisch Gladbach, Alemania
EUR 80,24
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Neuware -The two-volume set LNCS 15679 and 15680 constitutes the refereed proceedings of the 14th International Conference on Algorithms and Complexity, CIAC 2025, held in Rome, Italy, during June 10 12, 2025.The 44 full papers included in these proceedings were carefully reviewed and selected from 110 submissions. They focus on all aspects of important venue for researchers working on computational complexity and the design, analysis, experimentation, and application of efficient algorithms and data structures. 376 pp. Englisch.
Idioma: Inglés
Publicado por Springer, Springer International Publishing Mai 2025, 2025
ISBN 10: 3031929314 ISBN 13: 9783031929311
Librería: Wegmann1855, Zwiesel, Alemania
EUR 80,24
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Neuware -.- Exact and Approximate High-Multiplicity Scheduling on Identical Machines.- Unit refutations in Horn constraint systems.- On Exact Learning of $d$-Monotone Functions.- Computational Complexity of Combinatorial Distance Matrix Realisation.- Online Range Assignment Problems.- General Position Subset Selection in Line Arrangements.- Branching Programs with Extended Memory: New Insights.- Tatami Printer: Physical ZKPs for Tatami Puzzles.- On the Price of Anarchy in Packet Routing Games with FIFO.- On the Computational Complexity of Graph Reconstruction.- Efficient Certifying Algorithms for Linear Classification.- Improved Sublinear-time Moment Estimation using Weighted Sampling.- Structural Parameterizations of Locating-Dominating Set and Test Cover.- Improved bounds for group testing in arbitrary hypergraphs.- A Parameterized Perspective of All-Colors.- On the Discrete and Semi-Continuous Versions of the Two Watchtowers Problem in the Plane.- Degree Realization by Bipartite Cactus Graphs.- On Two Simple[st] Learning Tasks.- Dynamic Filter and Retrieval with One Access to Modifiable Memory.- Longest path transversals in claw-free and $P 5$-free graphs.- Realizing Graphs with Cut Constraints.- On The Computational Complexity of Games with Uncertainty.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 126,04
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Springer-Nature New York Inc, 2025
ISBN 10: 3031929314 ISBN 13: 9783031929311
Librería: Revaluation Books, Exeter, Reino Unido
EUR 120,06
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 376 pages. 9.25x6.10x9.21 inches. In Stock.
Librería: preigu, Osnabrück, Alemania
EUR 71,50
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Algorithms and Complexity | 14th International Conference, CIAC 2025, Rome, Italy, June 10-12, 2025, Proceedings, Part I | Irene Finocchi (u. a.) | Taschenbuch | Lecture Notes in Computer Science | xiv | Englisch | 2025 | Springer | EAN 9783031929311 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Idioma: Inglés
Publicado por Springer, Springer Mai 2025, 2025
ISBN 10: 3031929314 ISBN 13: 9783031929311
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 80,24
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Neuware - The two-volume set LNCS 15679 and 15680 constitutes the refereed proceedings of the 14th International Conference on Algorithms and Complexity, CIAC 2025, held in Rome, Italy, during June 10 12, 2025.The 44 full papers included in these proceedings were carefully reviewed and selected from 110 submissions. They focus on all aspects of important venue for researchers working on computational complexity and the design, analysis, experimentation, and application of efficient algorithms and data structures.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 66,23
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.
Idioma: Inglés
Publicado por Springer, Springer Mai 2025, 2025
ISBN 10: 3031929314 ISBN 13: 9783031929311
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 80,24
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The two-volume set LNCS 15679 and 15680 constitutes the refereed proceedings of the 14th International Conference on Algorithms and Complexity, CIAC 2025, held in Rome, Italy, during June 10 12, 2025.The 44 full papers included in these proceedings were carefully reviewed and selected from 110 submissions. They focus on all aspects of important venue for researchers working on computational complexity and the design, analysis, experimentation, and application of efficient algorithms and data structures. 376 pp. Englisch.
Idioma: Inglés
Publicado por Springer-Nature New York Inc, 2025
ISBN 10: 3031929314 ISBN 13: 9783031929311
Librería: Revaluation Books, Exeter, Reino Unido
EUR 104,68
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Brand New. 376 pages. 9.25x6.10x9.21 inches. In Stock. This item is printed on demand.
Librería: moluna, Greven, Alemania
EUR 70,33
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt.
Idioma: Inglés
Publicado por Springer International Publishing AG, Cham, 2025
ISBN 10: 3031929314 ISBN 13: 9783031929311
Librería: CitiRetail, Stevenage, Reino Unido
EUR 85,84
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: new. Paperback. The two-volume set LNCS 15679 and 15680 constitutes the refereed proceedings of the 14th International Conference on Algorithms and Complexity, CIAC 2025, held in Rome, Italy, during June 1012, 2025.The 44 full papers included in these proceedings were carefully reviewed and selected from 110 submissions. They focus on all aspects of important venue for researchers working on computational complexity and the design, analysis, experimentation, and application of efficient algorithms and data structures. mso-ansi-language: EN-US;">The two-volume set LNCS 15679 and 15680 constitutes the refereed proceedings of the 14th International Conference on Algorithms and Complexity, CIAC 2025, held in Rome, Italy, during June 1012, 2025. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 127,42
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 128,00
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND.
Idioma: Inglés
Publicado por Springer, Springer Mai 2025, 2025
ISBN 10: 3031929314 ISBN 13: 9783031929311
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 80,24
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -.- Exact and Approximate High-Multiplicity Scheduling on Identical Machines.- Unit refutations in Horn constraint systems.- On Exact Learning of $d$-Monotone Functions.- Computational Complexity of Combinatorial Distance Matrix Realisation.- Online Range Assignment Problems.- General Position Subset Selection in Line Arrangements.- Branching Programs with Extended Memory: New Insights.- Tatami Printer: Physical ZKPs for Tatami Puzzles.- On the Price of Anarchy in Packet Routing Games with FIFO.- On the Computational Complexity of Graph Reconstruction.- Efficient Certifying Algorithms for Linear Classification.- Improved Sublinear-time Moment Estimation using Weighted Sampling.- Structural Parameterizations of Locating-Dominating Set and Test Cover.- Improved bounds for group testing in arbitrary hypergraphs.- A Parameterized Perspective of All-Colors.- On the Discrete and Semi-Continuous Versions of the Two Watchtowers Problem in the Plane.- Degree Realization by Bipartite Cactus Graphs.- On Two Simple[st] Learning Tasks.- Dynamic Filter and Retrieval with One Access to Modifiable Memory.- Longest path transversals in claw-free and $P 5$-free graphs.- Realizing Graphs with Cut Constraints.- On The Computational Complexity of Games with Uncertainty.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 376 pp. Englisch.