Computing a longest increasing subsequence of length $ k $ in time $ O (n\ log\ log k) $

&
In Erol Gelenbe, Samson Abramsky & Vladimiro Sassone (eds.), Visions of Computer Science. British Computer Society. pp. 69--74 (2008)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,261

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Long finite sequences.Harvey Friedman - manuscript
Measuring measuring rods.John C. Graves & James E. Roper - 1965 - Philosophy of Science 32 (1):39-56.
What is length?Frank Henmueller & Karl Menger - 1961 - Philosophy of Science 28 (2):172-177.
Women and the social construction of the computing culture: Evolving new forms of computing. [REVIEW]Joan Truckenbrod - 1993 - AI and Society 7 (4):345-357.
Topological paradoxes of time measurement.Roy Lisker - unknown
On the beginning of time.Quentin Smith - 1985 - Noûs 19 (4):579-584.
Computing as a Science: A Survey of Competing Viewpoints. [REVIEW]Matti Tedre - 2011 - Minds and Machines 21 (3):361-387.
Free recall of word lists varying in length and rate of presentation: A test of total-time hypotheses.William A. Roberts - 1972 - Journal of Experimental Psychology 92 (3):365.
On the complexity of Gödel's proof predicate.Yijia Chen & Jörg Flum - 2010 - Journal of Symbolic Logic 75 (1):239-254.
Influence of chromatin molecular changes on RNA synthesis during embryonic development.Julian Chela-Flores - 1992 - Acta Biotheoretica 40 (1):41-49.
Shifting the paradigm of philosophy of science: Philosophy of information and a new renaissance. [REVIEW]Gordana Dodig-Crnkovic - 2003 - Minds and Machines 13 (4):521-536.
Schroedinger's Register: Foundational Issues and Physical Realization.Stephen Pink & Stanley Martens - manuscript
Program Verification and Functioning of Operative Computing Revisited: How about Mathematics Engineering? [REVIEW]Uri Pincas - 2011 - Minds and Machines 21 (2):337-359.
The shortest possible length of the longest implicational axiom.Dolph Ulrich - 1996 - Journal of Philosophical Logic 25 (1):101 - 108.

Analytics

Added to PP
2014-02-02

Downloads
45 (#355,274)

6 months
3 (#984,770)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references