This HTML5 document contains 43 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n13http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/resource/domain/vavai/projekt/
n16http://linked.opendata.cz/ontology/domain/vavai/
n15http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n8http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985840%3A_____%2F07%3A00096351%21RIV08-AV0-67985840/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F07%3A00096351%21RIV08-AV0-67985840
rdf:type
n16:Vysledek skos:Concept
dcterms:description
Článek prezentuje dolní odhad na počet řezů při dělení zdrojů In the cake cutting problem, n>2 players want to cut a cake into n pieces so that every player gets a ´fair´ share of the cake by his/her own measure. We prove that in a certain, natural cake cutting model, every fair cake division protocol for n players must use .OMEGA.(nlogn) cuts and evaluation queries in the worst case. Up to small constant factor, this lower bound matches a corresponding upper bound in the same model obtained by Even and Paz, from 1984 In the cake cutting problem, n>2 players want to cut a cake into n pieces so that every player gets a ´fair´ share of the cake by his/her own measure. We prove that in a certain, natural cake cutting model, every fair cake division protocol for n players must use .OMEGA.(nlogn) cuts and evaluation queries in the worst case. Up to small constant factor, this lower bound matches a corresponding upper bound in the same model obtained by Even and Paz, from 1984
dcterms:title
O složitosti dělení zdrojů On the complexity of cake cutting On the complexity of cake cutting
skos:prefLabel
On the complexity of cake cutting O složitosti dělení zdrojů On the complexity of cake cutting
skos:notation
RIV/67985840:_____/07:00096351!RIV08-AV0-67985840
n5:strany
213;220
n5:aktivita
n6:P n6:Z
n5:aktivity
P(1M0545), P(IAA1019401), Z(AV0Z10190503)
n5:cisloPeriodika
2
n5:dodaniDat
n12:2008
n5:domaciTvurceVysledku
n13:8679673
n5:druhVysledku
n17:J
n5:duvernostUdaju
n14:S
n5:entitaPredkladatele
n8:predkladatel
n5:idSjednocenehoVysledku
439332
n5:idVysledku
RIV/67985840:_____/07:00096351
n5:jazykVysledku
n10:eng
n5:klicovaSlova
fair division; complexity
n5:klicoveSlovo
n11:complexity n11:fair%20division
n5:kodStatuVydavatele
NL - Nizozemsko
n5:kontrolniKodProRIV
[933CF68E905B]
n5:nazevZdroje
Discrete Optimization
n5:obor
n18:BA
n5:pocetDomacichTvurcuVysledku
1
n5:pocetTvurcuVysledku
2
n5:projekt
n7:IAA1019401 n7:1M0545
n5:rokUplatneniVysledku
n12:2007
n5:svazekPeriodika
4
n5:tvurceVysledku
Woeginger, G. J. Sgall, Jiří
n5:zamer
n15:AV0Z10190503
s:issn
1572-5286
s:numberOfPages
8