Atnaujinkite slapukų nuostatas

Algorithms and Complexity: 14th International Conference, CIAC 2025, Rome, Italy, June 1012, 2025, Proceedings, Part I [Minkštas viršelis]

Edited by , Edited by
  • Formatas: Paperback / softback, 362 pages, aukštis x plotis: 235x155 mm, 47 Illustrations, color; 24 Illustrations, black and white; XIV, 362 p. 71 illus., 47 illus. in color., 1 Paperback / softback
  • Serija: Lecture Notes in Computer Science 15679
  • Išleidimo metai: 18-May-2025
  • Leidėjas: Springer International Publishing AG
  • ISBN-10: 3031929314
  • ISBN-13: 9783031929311
Kitos knygos pagal šią temą:
Algorithms and Complexity: 14th International Conference, CIAC 2025, Rome, Italy, June 1012, 2025, Proceedings, Part IDidesnis paveikslėlis
  • Formatas: Paperback / softback, 362 pages, aukštis x plotis: 235x155 mm, 47 Illustrations, color; 24 Illustrations, black and white; XIV, 362 p. 71 illus., 47 illus. in color., 1 Paperback / softback
  • Serija: Lecture Notes in Computer Science 15679
  • Išleidimo metai: 18-May-2025
  • Leidėjas: Springer International Publishing AG
  • ISBN-10: 3031929314
  • ISBN-13: 9783031929311
Kitos knygos pagal šią temą:
Pastovi nuoroda: https://www.kriso.lt/db/9783031929311.html
Raktažodžiai:

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.

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