About: A lower bound for cake cutting.

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: A lower bound for cake cutting. Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	We prove that in a certain cake cutting model, every fair cake division protocol for $n$ players must use $ Omega (nlog n) $. Up to a small constant factor, our lower bound matches a corresponding upper bound in the same model by Even & Paz from 1984. We prove that in a certain cake cutting model, every fair cake division protocol for $n$ players must use $ Omega (nlog n) $. Up to a small constant factor, our lower bound matches a corresponding upper bound in the same model by Even & Paz from 1984. (en)
Title	A lower bound for cake cutting. A lower bound for cake cutting. (en)
skos:prefLabel	A lower bound for cake cutting. A lower bound for cake cutting. (en)
skos:notation	RIV/67985840:_____/03:05030096!RIV/2004/MSM/A05004/N
http://linked.open.../vavai/riv/strany	459;469
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(IAA1019901), P(LN00A056), Z(AV0Z1019905)
http://linked.open...vai/riv/dodaniDat	2004
http://linked.open...aciTvurceVysledku	Sgall, Jiří
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Matematický ústav AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	596926
http://linked.open...ai/riv/idVysledku	RIV/67985840:_____/03:05030096
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	concrete complexity; cake-cutting; lower bound (en)
http://linked.open.../riv/klicoveSlovo	cake-cutting lower bound concrete complexity
http://linked.open...ontrolniKodProRIV	[2A1795349450]
http://linked.open...v/mistoKonaniAkce	Budapest [HU]
http://linked.open...i/riv/mistoVydani	Berlin
http://linked.open...i/riv/nazevZdroje	Proceedings of the 11th Annual European Symposium on Algorithms.
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...ocetUcastnikuAkce	0 (xsd:int)
http://linked.open...nichUcastnikuAkce	0 (xsd:int)
http://linked.open...vavai/riv/projekt	Institute of Theoretical Computer Science (Center of Young Science) Mathematical logic and computational complexity
http://linked.open...UplatneniVysledku	2003
http://linked.open...iv/tvurceVysledku	Sgall, Jiří Woeginger, G. J.
http://linked.open...vavai/riv/typAkce	EUR - Evropská
http://linked.open.../riv/zahajeniAkce	2003-09-15 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Complex development of all branches of mathematics with regard to the needs of physics and technology
number of pages	11 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Springer-Verlag

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software