On the complexity of finding paths in a two-dimensional domain I: Shortest paths: Shortest paths

Mathematical Logic Quarterly 50 (6):551 (2004)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

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

Similar books and articles

Finding paths through narrow and wide trees.Stephen Binns & Bjørn Kjos-Hanssen - 2009 - Journal of Symbolic Logic 74 (1):349-360.
From states of affairs to a necessary being.Joshua Rasmussen - 2010 - Philosophical Studies 148 (2):183 - 200.
Multiple retrieval paths and long-term retention.Thomas O. Nelson & Charles C. Hill - 1974 - Journal of Experimental Psychology 103 (1):185.
An incomplete set of shortest descriptions.Frank Stephan & Jason Teutsch - 2012 - Journal of Symbolic Logic 77 (1):291-307.
Paths in Zygmunt Bauman's Social Thought.Keith Tester - 2002 - Thesis Eleven 70 (1):55-71.
Semantic holism is seriously false.Gerald J. Massey - 1990 - Studia Logica 49 (1):83 - 86.

Analytics

Added to PP
2013-12-01

Downloads
2 (#1,784,141)

6 months
1 (#1,510,037)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Asher Chou
University of South Florida

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references