License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2014.614
URN: urn:nbn:de:0030-drops-44927
URL: https://drops.dagstuhl.de/opus/volltexte/2014/4492/
Go to the corresponding LIPIcs Volume Portal


Pierrot, Adeline ; Rossin, Dominique

2-Stack Sorting is polynomial

pdf-format:
50.pdf (0.7 MB)


Abstract

This article deals with deciding whether a permutation is sortable with two stacks in series. Whether this decision problem lies in P or is NP-complete is a longstanding open problem since the introduction of serial compositions of stacks by Knuth in The Art of Computer Programming in 1973. We hereby prove that this decision problem lies in P by giving a polynomial algorithm to solve it. This algorithm uses the concept of pushall sorting, which was previously defined and studied by the authors.

BibTeX - Entry

@InProceedings{pierrot_et_al:LIPIcs:2014:4492,
  author =	{Adeline Pierrot and Dominique Rossin},
  title =	{{2-Stack Sorting is polynomial}},
  booktitle =	{31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
  pages =	{614--626},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-65-1},
  ISSN =	{1868-8969},
  year =	{2014},
  volume =	{25},
  editor =	{Ernst W. Mayr and Natacha Portier},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2014/4492},
  URN =		{urn:nbn:de:0030-drops-44927},
  doi =		{10.4230/LIPIcs.STACS.2014.614},
  annote =	{Keywords: permutation, stack, sort, NP-complete}
}

Keywords: permutation, stack, sort, NP-complete
Collection: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Issue Date: 2014
Date of publication: 05.03.2014


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI