Find link

language:

Find link is a tool written by Edward Betts.

searching for EXPSPACE 5 found (32 total)

alternate case: eXPSPACE

Hierarchical task network (626 words) [view diff] exact match in snippet view article find links to article

planning are decidable, with known complexities ranging from NP-complete to 2-EXPSPACE-complete, and some HTN problems can be efficiently compiled into PDDL,

Go and mathematics (1,727 words) [view diff] exact match in snippet view article find links to article

currently stands, it might be PSPACE-complete, EXPTIME-complete, or even EXPSPACE-complete. Japanese ko rules state that only the basic ko, that is, a move

Presburger arithmetic (3,225 words) [view diff] exact match in snippet view article find links to article

exponential nondeterministic time (2-NEXP) and double exponential space (2-EXPSPACE). Completeness is under polynomial time many-to-one reductions. (Also,

Reachability problem (841 words) [view diff] exact match in snippet view article find links to article

a Petri net is decidable. Since 1976, it is known that this problem is EXPSPACE-hard. There are results on how much to implement this problem in practice

David Wiseman (1,987 words) [view diff] case mismatch in snippet view article find links to article

2020. "David Wiseman Invited to Design Piece for the President's House". EXPspace RISD. Retrieved 2016-04-18. Wall Design. DAAB Books. 2007. ISBN 978-3866540101