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 10–12, 2025.
"Sinopsis" puede pertenecer a otra edición de este libro.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
Condición: new. Questo è un articolo print on demand. Nº de ref. del artículo: USAF7IIVME
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 50255866-n
Cantidad disponible: 1 disponibles
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: DB-9783031929311
Cantidad disponible: 1 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: DB-9783031929311
Cantidad disponible: 1 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 50255866
Cantidad disponible: 1 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 50255866-n
Cantidad disponible: 1 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 50255866
Cantidad disponible: 1 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. 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. Nº de ref. del artículo: 9783031929311
Cantidad disponible: 1 disponibles
Librería: Rheinberg-Buch Andreas Meier eK, Bergisch Gladbach, Alemania
Taschenbuch. 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. Nº de ref. del artículo: 9783031929311
Cantidad disponible: 1 disponibles
Librería: Wegmann1855, Zwiesel, Alemania
Taschenbuch. 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. Nº de ref. del artículo: 9783031929311
Cantidad disponible: 1 disponibles