KAM-DIMATIA Series 2004-688 and ITI Series 2004-208. On the complexity of cake cutting
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F04%3A00106925" target="_blank" >RIV/67985840:_____/04:00106925 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
KAM-DIMATIA Series 2004-688 and ITI Series 2004-208. On the complexity of cake cutting
Original language description
In the cake cutting problem, $n/ge2$ players want to cut a cake into $n$ pieces so that every player gets a ďfairď share of the cake by his own measure. One positive and one negative results are given.
Czech name
O složitosti dělení dortů
Czech description
Článek studuje složitost dělení dortů.
Classification
Type
V<sub>x</sub> - Unclassified - Research report containing classified information
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2004
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Number of pages
20
Place of publication
Praha
Publisher/client name
Neuveden
Version
—