Skip Navigation

Logic Journal of IGPL 2001 9(5):687-692; doi:10.1093/jigpal/9.5.687
© 2001 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Parikh, R.
Right arrow Articles by Pratt, V.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Article

Sock Sorting: An Example of a Vague Algorithm

Rohit Parikh1, Laxmi Parida2 and Vaughan Pratt3

1 Department of Computer Science, CUNY Graduate Center, 365 Fifth Avenue, New York, NY 10016. E-mail: rparikh{at}gc.cuny.edu 2 IBM Thomas J Watson Research Center, PO Box 704, Yorktown Heights, New York 10598. E-mail: parida{at}us.ibm.com 3 Gates 4B, Computer Science Dept, Stanford University, Stanford, CA 94305-9045. E-mail: pratt{at}cs.stanford.edu

We give an example of a polynomial time algorithm for a particular algorithmic problem involving vagueness and visual indiscriminability, namely sock sorting.

Key Words: Vagueness, Matching

Received November 9, 1999.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.