The Sub-exponential Upper Bound for On-Line Chain Partitioning
Tytuł rozdziału:
The Sub-exponential Upper Bound for On-Line Chain Partitioning
Tytuł książki:
51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA
Wydawnictwo:
Institute of Electrical and Electronics Engineers (IEEE)
Rok:
2010
Strony:
347-354
Numer DOI:
10.1109/FOCS.2010.40
Link:
https://doi.org/10.1109/FOCS.2010.40
Mathscinet link:
https://www.ams.org/mathscinet-getitem?mr=3025208
DBLP link:
https://dblp.org/rec/conf/focs/BosekK10