Rush Hour is PSPACE-complete, or ''Why you should generously tip parking lot attendants''

Authors: Flake G.W.1; Baum E.B.

Source: Theoretical Computer Science, Volume 270, Number 1, 6 January 2002 , pp. 895-911(17)

Publisher: Elsevier

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

Keywords: Games; PSPACE-completeness; Reversible logic; Motion planning; Dual-rail logic

Language: English

Document Type: Research article

DOI: 10.1016/S0304-3975(01)00173-6

Affiliations: 1: NEC Research Institute, 4 Independence Way, 08540, Princeton, NJ, USA

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.

Proceed

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A