◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

The Smith Problem Solving Group

1 paper hereh-index 116 citations1 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • last author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • cs.CG1

identity via Semantic Scholar / OpenAlex

collaborators
Showing cs.CGShow all

1 paper · 1 filter

cs.CG1999

PushPush is NP-hard in 3D

Joseph O'Rourke, The Smith Problem Solving Group

We prove that a particular pushing-blocks puzzle is intractable in 3D. The puzzle, inspired by the game PushPush, consists of unit square blocks on an integer lattice. An agent may…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.