0175344 - MU-W 20030096 RIV DE eng C - Conference Paper (international conference)
Sgall, Jiří - Woeginger, G. J.A lower bound for cake cutting.
Proceedings of the 11th Annual European Symposium on Algorithms. Berlin: Springer, 2003, s. 459-469. Lecture Notes in Computer Science., 2832.
[Annual European Symposium on Algorithms/11./. Budapest (HU), 15.09.2003-20.09.2003]
R&D Projects: GA MŠMT LN00A056; GA AV ČR IAA1019901
Institutional research plan: CEZ:AV0Z1019905; CEZ:AV0Z1019905
Keywords : concrete complexity * cake-cutting * lower bound
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0072328
