Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Which Multi-peg Tower of Hanoi Problems Are Exponential? - MaRDI portal

Which Multi-peg Tower of Hanoi Problems Are Exponential?

From MaRDI portal

Publication:5200496

Jump to:navigation, search

DOI10.1007/978-3-642-34611-8_11zbMath1321.68297OpenAlexW110984931MaRDI QIDQ5200496

Daniel Berend, Amir Sapir

Publication date: 6 November 2012

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-34611-8_11

zbMATH Keywords

connectivity directed graphs Tower of Hanoi shed sub-exponential complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (1)

Algorithmic calculation of the optimality probability of decision rules

This page was built for publication: Which Multi-peg Tower of Hanoi Problems Are Exponential?

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5200496&oldid=19798153"