Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	Mai 2025
Genre:	EDV / Informatik
	Algorithms / approximation algorithms / Artificial Intelligence / Combinatorics / Computational complexity / Computer Graphics / Computer System Implementation / Data Structures / Design and Analysis of Algorithms / distributed and parallel algorithms / geometry / Graph algorithms / Künstliche Intelligenz / Mathematik für Informatiker / online algorithms / Parameterized complexity and exact algorithms / Randomness / Streaming / Symbolic and Algebraic Manipulation / Systemanalyse und -design / theoretical computer science / Theoretische Informatik mehr...
ISBN:	9783031929311
EAN-Code:	9783031929311
Verlag:	Springer International Publishing
Einband:	Kartoniert
Sprache:	English
Dimensionen:	H 235 mm / B 155 mm / D
Seiten:	362
Illustration:	XIV, 362 p. 71 illus., 47 illus. in color., farbige Illustrationen, schwarz-weiss Illustrationen
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

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