Knihobot

Cake Cutting Algorithms

Be Fair If You Can

Hodnocení knihy

3,5(6)Ohodnotit

Parametry

  • 177 stránek
  • 7 hodin čtení

Více o knize

Focusing on cake-cutting problems, this book provides an accessible yet thorough exploration of various algorithms related to fairness in division. It caters to a wide audience, from high school students to seasoned researchers, presenting complex concepts in a clear and engaging manner. The authors, Robertson and Webb, effectively illuminate the intricacies of the subject, making it a valuable resource for anyone interested in this mathematical challenge.

Nákup knihy

Cake Cutting Algorithms, Jack Robertson, William Webb

Jazyk
Rok vydání
1998
product-detail.submit-box.info.binding
(pevná)
Jakmile se objeví, pošleme e-mail.

Doručení

Platební metody

3,5
Dobrá
6 Hodnocení

Tady nám chybí tvá recenze.