Picture-Hanging Puzzles
We show how to hang a picture by wrapping rope around n nails, making a polynomial number of twists, such that the picture falls whenever any k out of the n nails get removed, and the picture remains hanging when fewer than k nails get removed. This construction makes for some fun mathematical magic...
Saved in:
Published in | Theory of computing systems Vol. 54; no. 4; pp. 531 - 550 |
---|---|
Main Authors | , , , , , |
Format | Journal Article |
Language | English |
Published |
Boston
Springer US
01.05.2014
Springer Nature B.V |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | We show how to hang a picture by wrapping rope around
n
nails, making a polynomial number of twists, such that the picture falls whenever any
k
out of the
n
nails get removed, and the picture remains hanging when fewer than
k
nails get removed. This construction makes for some fun mathematical magic performances. More generally, we characterize the possible Boolean functions characterizing when the picture falls in terms of which nails get removed as all monotone Boolean functions. This construction requires an exponential number of twists in the worst case, but exponential complexity is almost always necessary for general functions. |
---|---|
AbstractList | Issue Title: Fun with Algorithms We show how to hang a picture by wrapping rope around n nails, making a polynomial number of twists, such that the picture falls whenever any k out of the n nails get removed, and the picture remains hanging when fewer than k nails get removed. This construction makes for some fun mathematical magic performances. More generally, we characterize the possible Boolean functions characterizing when the picture falls in terms of which nails get removed as all monotone Boolean functions. This construction requires an exponential number of twists in the worst case, but exponential complexity is almost always necessary for general functions.[PUBLICATION ABSTRACT] We show how to hang a picture by wrapping rope around n nails, making a polynomial number of twists, such that the picture falls whenever any k out of the n nails get removed, and the picture remains hanging when fewer than k nails get removed. This construction makes for some fun mathematical magic performances. More generally, we characterize the possible Boolean functions characterizing when the picture falls in terms of which nails get removed as all monotone Boolean functions. This construction requires an exponential number of twists in the worst case, but exponential complexity is almost always necessary for general functions. We show how to hang a picture by wrapping rope around n nails, making a polynomial number of twists, such that the picture falls whenever any k out of the n nails get removed, and the picture remains hanging when fewer than k nails get removed. This construction makes for some fun mathematical magic performances. More generally, we characterize the possible Boolean functions characterizing when the picture falls in terms of which nails get removed as all monotone Boolean functions. This construction requires an exponential number of twists in the worst case, but exponential complexity is almost always necessary for general functions. |
Author | Mitchell, Joseph S. B. Demaine, Erik D. Demaine, Martin L. Rivest, Ronald L. Pǎtraşcu, Mihai Minsky, Yair N. |
Author_xml | – sequence: 1 givenname: Erik D. surname: Demaine fullname: Demaine, Erik D. email: edemaine@mit.edu organization: MIT Computer Science and Artificial Intelligence Laboratory – sequence: 2 givenname: Martin L. surname: Demaine fullname: Demaine, Martin L. organization: MIT Computer Science and Artificial Intelligence Laboratory – sequence: 3 givenname: Yair N. surname: Minsky fullname: Minsky, Yair N. organization: Department of Mathematics, Yale University – sequence: 4 givenname: Joseph S. B. surname: Mitchell fullname: Mitchell, Joseph S. B. organization: Department of Applied Mathematics and Statistics, State University of New York – sequence: 5 givenname: Ronald L. surname: Rivest fullname: Rivest, Ronald L. organization: MIT Computer Science and Artificial Intelligence Laboratory – sequence: 6 givenname: Mihai surname: Pǎtraşcu fullname: Pǎtraşcu, Mihai organization: AT&T Labs—Research |
BookMark | eNp1kE1LAzEQhoNUsK2exZvgxUt0Jh-7m6MUa4WCPeg5xCRbtmyzNeke7K83dT2I4GkG5nmHmWdCRqELnpArhDsEKO8TAGOCAnKqJCCFEzJGwTkFoWD03TMquIQzMklpAwC8AhiTy1Vj9330dGHCugnr61V_OLQ-nZPT2rTJX_zUKXmbP77OFnT58vQ8e1hSKyTbU1eA5VXtZFFbVjG0dVHXKKVT3llrvJJopILSG-HeTenyqBKicrbghXO-5FNyO-zdxe6j92mvt02yvm1N8F2fNEqBXCmGVUZv_qCbro8hX5cpLHiZf1SZwoGysUsp-lrvYrM18VMj6KMqPajSWZU-qtKQM2zIpMyGtY-_Nv8b-gKI5Wsx |
CODEN | TCSYFI |
CitedBy_id | crossref_primary_10_1307_mmj_20216166 crossref_primary_10_1126_science_ade7759 crossref_primary_10_1080_00927872_2020_1740243 |
Cites_doi | 10.1070/IM1985v025n01ABEH001269 10.1007/BF02579338 10.1007/BF01840378 10.1017/S0080456800090633 |
ContentType | Journal Article |
Copyright | Springer Science+Business Media New York 2013 Springer Science+Business Media New York 2014 |
Copyright_xml | – notice: Springer Science+Business Media New York 2013 – notice: Springer Science+Business Media New York 2014 |
DBID | AAYXX CITATION 0U~ 1-H 3V. 7SC 7WY 7WZ 7XB 87Z 88I 8AL 8AO 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ HCIFZ JQ2 K60 K6~ K7- L.- L.0 L6V L7M L~C L~D M0C M0N M2P M7S P5Z P62 PQBIZ PQBZA PQEST PQQKQ PQUKI PRINS PTHSS PYYUZ Q9U |
DOI | 10.1007/s00224-013-9501-0 |
DatabaseName | CrossRef Global News & ABI/Inform Professional Trade PRO ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Science Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni Edition) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Central Business Premium Collection Technology Collection ProQuest One Community College ProQuest Central Korea Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced ABI/INFORM Professional Standard ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Computing Database Science Database Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection One Business (ProQuest) ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ABI/INFORM Collection China ProQuest Central Basic |
DatabaseTitle | CrossRef ProQuest Business Collection (Alumni Edition) Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection Trade PRO ProQuest Central China ABI/INFORM Complete Global News & ABI/Inform Professional Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest One Academic ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ABI/INFORM Professional Standard ProQuest Central Korea Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ABI/INFORM China ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
DatabaseTitleList | ProQuest Business Collection (Alumni Edition) Computer and Information Systems Abstracts |
Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Mathematics Computer Science |
EISSN | 1433-0490 |
EndPage | 550 |
ExternalDocumentID | 3275991871 10_1007_s00224_013_9501_0 |
Genre | Feature |
GroupedDBID | --Z -59 -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 123 1N0 2.D 203 29Q 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5QI 5VS 67Z 6NX 7WY 88I 8AO 8FE 8FG 8FL 8TC 8UJ 8V8 95- 95. 95~ 96X AAAVM AABHQ AABYN AAFGU AAHNG AAIAL AAJKR AANZL AAOBN AAPBV AARHV AARTL AATNV AATVU AAUYE AAWCG AAWWR AAYFA AAYIU AAYQN AAYTO ABBBX ABBXA ABDBF ABDZT ABECU ABFGW ABFTD ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKAS ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABPTK ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACBMV ACBRV ACBXY ACBYP ACGFS ACGOD ACHSB ACHXU ACIGE ACIPQ ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACTTH ACVWB ACWMK ADGRI ADHIR ADIMF ADINQ ADKNI ADKPE ADMDM ADOXG ADPHR ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEEQQ AEFIE AEFTE AEGAL AEGNC AEJHL AEJRE AEKMD AEMOZ AENEX AEOHA AEPYU AESKC AESTI AETLH AEVLU AEVTX AEXYK AEYWE AFEXP AFGCZ AFKRA AFLOW AFNRJ AFQWF AFWTZ AFZKB AGAYW AGDGC AGGBP AGGDS AGJBK AGMZJ AGQMX AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AIAKS AIIXL AILAN AIMYW AITGF AJBLW AJDOV AJRNO AJZVZ AKQUC AKVCP ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AOCGG ARAPS ARCSS ARMRJ AXYYD AYJHY AZFZN AZQEC B-. B0M BA0 BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ CAG CCPQU COF CS3 CSCUP D0L DDRTE DL5 DNIVK DPUIP DU5 DWQXO EAD EAP EBA EBLON EBR EBS EBU ECS EDO EIOEI EJD EMK EPL ESBYG EST ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GXS HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K1G K60 K6V K6~ K7- KDC KOV L6V LAS LLZTM M0C M0N M2P M4Y M7S MA- MK~ ML~ NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9O PF- PQBIZ PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS R89 R9I RNI ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TH9 TSG TSK TSV TUC TUS U2A UG4 UNUBA UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WH7 WK8 XOL YLTOR Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZMTXR ~8M AACDK AAEOY AAJBT AASML AAYXX ABAKF ACAOD ACDTI ACZOJ AEFQL AEMSY AFBBN AGQEE AIGIU CITATION H13 PQBZA 0U~ 1-H 7SC 7XB 8AL 8FD 8FK JQ2 L.- L.0 L7M L~C L~D PQEST PQUKI PRINS Q9U |
ID | FETCH-LOGICAL-c452t-d60c38fd56fc2821cf6ff155d9edccae951a5907ea4dba7d1558448dc636dde73 |
IEDL.DBID | BENPR |
ISSN | 1432-4350 |
IngestDate | Sat Aug 17 02:37:35 EDT 2024 Fri Sep 13 05:43:01 EDT 2024 Thu Sep 12 16:52:39 EDT 2024 Sat Dec 16 12:03:01 EST 2023 |
IsDoiOpenAccess | false |
IsOpenAccess | true |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 4 |
Keywords | Algorithms Topology Monotone functions Free group Magic |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c452t-d60c38fd56fc2821cf6ff155d9edccae951a5907ea4dba7d1558448dc636dde73 |
Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
PQID | 1516371439 |
PQPubID | 48907 |
PageCount | 20 |
ParticipantIDs | proquest_miscellaneous_1541399218 proquest_journals_1516371439 crossref_primary_10_1007_s00224_013_9501_0 springer_journals_10_1007_s00224_013_9501_0 |
PublicationCentury | 2000 |
PublicationDate | 2014-05-01 |
PublicationDateYYYYMMDD | 2014-05-01 |
PublicationDate_xml | – month: 05 year: 2014 text: 2014-05-01 day: 01 |
PublicationDecade | 2010 |
PublicationPlace | Boston |
PublicationPlace_xml | – name: Boston – name: New York |
PublicationTitle | Theory of computing systems |
PublicationTitleAbbrev | Theory Comput Syst |
PublicationYear | 2014 |
Publisher | Springer US Springer Nature B.V |
Publisher_xml | – name: Springer US – name: Springer Nature B.V |
References | Theodore (CR12) 1999 Ajtai, Komlós, Szemerédi (CR1) 1983; 3 Demaine, Demaine, Uehara (CR3) 2010 Pegg (CR7) 2002 CR14 Paterson (CR6) 1990; 5 Sloane (CR10) 2002 CR11 Ellul, Krawetz, Shallit, Wang (CR4) 2005; 9 Makanin (CR5) 1985; 25 Sillke (CR9) 2001 Brunn (CR2) 1892 Rolfsen (CR8) 1976 Tait (CR13) 1876; 28 H. Brunn (9501_CR2) 1892 9501_CR14 9501_CR11 S. Theodore (9501_CR12) 1999 P.G. Tait (9501_CR13) 1876; 28 M. Ajtai (9501_CR1) 1983; 3 N.J.A. Sloane (9501_CR10) 2002 K. Ellul (9501_CR4) 2005; 9 T. Sillke (9501_CR9) 2001 E.D. Demaine (9501_CR3) 2010 Ed Pegg Jr. (9501_CR7) 2002 M.S. Paterson (9501_CR6) 1990; 5 D. Rolfsen (9501_CR8) 1976 G.S. Makanin (9501_CR5) 1985; 25 |
References_xml | – volume: 9 start-page: 233 issue: 2–3 year: 2005 end-page: 256 ident: CR4 article-title: Regular expressions: new results and open problems publication-title: J. Autom. Lang. Comb. contributor: fullname: Wang – volume: 25 start-page: 75 issue: 1 year: 1985 end-page: 88 ident: CR5 article-title: Decidability of the universal and positive theories of a free group publication-title: Math. USSR, Izv. doi: 10.1070/IM1985v025n01ABEH001269 contributor: fullname: Makanin – year: 2001 ident: CR9 publication-title: Strange painting contributor: fullname: Sillke – volume: 3 start-page: 1 issue: 1 year: 1983 end-page: 19 ident: CR1 article-title: Sorting in log parallel steps publication-title: Combinatorica doi: 10.1007/BF02579338 contributor: fullname: Szemerédi – start-page: 77 year: 1892 end-page: 99 ident: CR2 article-title: Über Verkettung publication-title: Sitzungsbericht der Bayerischen Akademie der Wissenschaft Mathematisch Naturwissenschaftliche Abteilung contributor: fullname: Brunn – ident: CR14 – year: 1999 ident: CR12 publication-title: Brunnian braids and some of their generalizations contributor: fullname: Theodore – ident: CR11 – volume: 5 start-page: 75 year: 1990 end-page: 92 ident: CR6 article-title: Improved sorting networks with (log ) depth publication-title: Algorithmica doi: 10.1007/BF01840378 contributor: fullname: Paterson – start-page: 139 year: 2010 end-page: 142 ident: CR3 article-title: Any monotone Boolean function can be realized by interlocked polygons publication-title: Proceedings of the 22nd Canadian Conference on Computational Geometry contributor: fullname: Uehara – year: 2002 ident: CR7 publication-title: Picture Hanging contributor: fullname: Pegg – volume: 28 start-page: 145 year: 1876 end-page: 190 ident: CR13 article-title: On knots publication-title: Trans. R. Soc. Edinb. contributor: fullname: Tait – year: 1976 ident: CR8 publication-title: Knots and Links contributor: fullname: Rolfsen – year: 2002 ident: CR10 article-title: Sequence A073121 publication-title: On-Line Encyclopedia of Integer Sequences contributor: fullname: Sloane – start-page: 77 volume-title: Sitzungsbericht der Bayerischen Akademie der Wissenschaft Mathematisch Naturwissenschaftliche Abteilung year: 1892 ident: 9501_CR2 contributor: fullname: H. Brunn – volume-title: Brunnian braids and some of their generalizations year: 1999 ident: 9501_CR12 contributor: fullname: S. Theodore – volume-title: Picture Hanging year: 2002 ident: 9501_CR7 contributor: fullname: Ed Pegg Jr. – volume-title: Strange painting year: 2001 ident: 9501_CR9 contributor: fullname: T. Sillke – volume: 28 start-page: 145 year: 1876 ident: 9501_CR13 publication-title: Trans. R. Soc. Edinb. doi: 10.1017/S0080456800090633 contributor: fullname: P.G. Tait – volume: 3 start-page: 1 issue: 1 year: 1983 ident: 9501_CR1 publication-title: Combinatorica doi: 10.1007/BF02579338 contributor: fullname: M. Ajtai – start-page: 139 volume-title: Proceedings of the 22nd Canadian Conference on Computational Geometry year: 2010 ident: 9501_CR3 contributor: fullname: E.D. Demaine – ident: 9501_CR14 – volume-title: On-Line Encyclopedia of Integer Sequences year: 2002 ident: 9501_CR10 contributor: fullname: N.J.A. Sloane – ident: 9501_CR11 – volume: 9 start-page: 233 issue: 2–3 year: 2005 ident: 9501_CR4 publication-title: J. Autom. Lang. Comb. contributor: fullname: K. Ellul – volume: 25 start-page: 75 issue: 1 year: 1985 ident: 9501_CR5 publication-title: Math. USSR, Izv. doi: 10.1070/IM1985v025n01ABEH001269 contributor: fullname: G.S. Makanin – volume: 5 start-page: 75 year: 1990 ident: 9501_CR6 publication-title: Algorithmica doi: 10.1007/BF01840378 contributor: fullname: M.S. Paterson – volume-title: Knots and Links year: 1976 ident: 9501_CR8 contributor: fullname: D. Rolfsen |
SSID | ssj0003800 |
Score | 2.0583203 |
Snippet | We show how to hang a picture by wrapping rope around
n
nails, making a polynomial number of twists, such that the picture falls whenever any
k
out of the
n... Issue Title: Fun with Algorithms We show how to hang a picture by wrapping rope around n nails, making a polynomial number of twists, such that the picture... We show how to hang a picture by wrapping rope around n nails, making a polynomial number of twists, such that the picture falls whenever any k out of the n... |
SourceID | proquest crossref springer |
SourceType | Aggregation Database Publisher |
StartPage | 531 |
SubjectTerms | Algorithms Analysis Applied mathematics Boolean Boolean functions Computer Science Construction Magic & magicians Mathematical analysis Mathematical models Nails Pictures Polynomials Puzzles Studies Theory of Computation Topological manifolds Wrapping |
SummonAdditionalLinks | – databaseName: SpringerLINK - Czech Republic Consortium dbid: AGYKE link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED6VdoGBQnkFCgoSE8hVG9t5jBVqqUBFHahUpiixHYSKUkSSpb-ec168B8bElqOcz77vfL7vAC6iviMdrgaEKk8QJl1OXKoP4Bm1ZKgDc0xnI0_v7cmc3S74ogFWfXQRL3tVRDLfqOtct9zaEF2MwOPaBd6AFtdVqZvQGt483o3q_Ze6eeIJAgGdD8TrWOZvg3y1Rh8Q81tUNDc243aRAJjkHIX6jsmyl6VhT6x_Mjj-4z92YLvEnuawUJZdaKi4A-2qroNZLvMObE1rLtdkDw5nz3mYgUwCzV34ZM6y9fpFJfswH48eriekLKdABONWSqTdF9SNJLcjgY7WQER2FCGckJ6SOI8KsVbA0VdWAZNh4EhswplypbCpjZugQw-gGa9idQSmGzDBpKNcN5DoMlEEMULQCN8M8LlvGXBZidV_LVgz_JofOReAjwLwtQD8vgHdSvB-uYASH4GIrckEqWfAed2Mqq_jGUGsVpnugxbY8xCkGHBVCfvTEH998PhfvU9gE0ESKy45dqGZvmXqFIFIGp6VmvcO5bvQ7Q priority: 102 providerName: Springer Nature |
Title | Picture-Hanging Puzzles |
URI | https://link.springer.com/article/10.1007/s00224-013-9501-0 https://www.proquest.com/docview/1516371439/abstract/ https://search.proquest.com/docview/1541399218 |
Volume | 54 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3dS8MwED_28aIPfsyv6RwTfFLCuiZt0yfZZB8oG0MczKfSJakIsk23veyv965rOxX0qbQpCfyS3P0ul7sDuI4sT3uOaTBufMWElg6TnA7gBbf1hBxzgqKR-wO3NxIPY2ecg14aC0PXKlOZGAtqPVN0Rl5HzeRSdjnu18MJnQKoZf1u_sGofhT5WZNiGnko2g1BDttiqz0YPmVSmcs4HAU7oCghJ_NwWnFCUVRkjOoc-A5Z1z911JZ4_vKVxiqocwB7CXesNTeTfQg5My3BflqXoZZs0xLs9rNcrIsjOB2-xW4C1gsp9-Brbbhar9_N4hhGnfbzfY8l5RCYEo69ZNq1FJeRdtxIoaHUUJEbRUgHtG80zoNBrhQ6aOuaUOhJ6GlsQqSlVi53UYh5_AQK09nUnEFNhkIJ7RkpQ40mD0cSohSP8EsD3y27DDcpAMF8k_UiyPIbx2gFiFZAaAVWGSopREGyARbBdrrKcJU149Ilf0Q4NbMV_YMa1PeRZJThNoX2Wxd_DXj-_4AXsIOsRmxuJVagsPxcmUtkDstJFfKy061CsdlptQb07L48tqvJUsHWkd38AmCnwrI |
link.rule.ids | 315,786,790,12792,21416,27957,27958,33408,33409,33779,33780,41116,41558,42185,42627,43635,43840,52146,52269,74392,74659 |
linkProvider | ProQuest |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LT8MwDLZgHIADj_EqDCgSJ1BEt6RtekKANhXYpglt0m5Rl6QICXWDbpf9epyu7QAJjm3aRvri2p_txAa4jB1f-a6uE6oDSZjiLuHUBOAZbaiRScwxcxq50_XCAXsausM84Jbm2yoLnZgpajWWJkZ-g5bJM9XlaHA7-SCma5TJruYtNFZhjVF0VSqwdt_s9l5KXUx5dggFXzNng9wyr-lkZUTRfBHT3SBwjU_90zIt6eavDGlmeFo7sJUzRvtuscS7sKKTKmwX3Rjs_OeswmanrMCa7sFh7y1LDpAwMhUHX-3ebD5_1-k-DFrN_kNI8iYIRDK3MSXKcyTlsXK9WKJ7VJexF8dIAlSgFaKvkSFFLnq4OmJqFPkKhxBfrqRHPVRdPj2ASjJO9BHYPGKSKV9zHil0dBAwT0oa4506XjsNC64KAMRkUetClFWNM7QEoiUMWsKxoFZAJHKxT8VykSy4KIdRYE0WIkr0eGaeQbsZBEgtLLguoP32ib8mPP5_wnNYD_udtmg_dp9PYAN5DVvsS6xBZfo506fIHaajs1xAvgDWrb0G |
linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3dS8MwED90guiDH_OrOrWCT0pYtyRt-iSi1vmxsQcHeytdkoog3XTby_56L13aqaCPbUICvyR3v8td7gDOUy9QAdcNQnUoCVOCE0HNBTyjTTUwjjlmXiO3O36rxx77vG_jn8Y2rLKQibmgVkNp7sjrqJl8k12OhvXUhkV0b6Or0QcxFaSMp9WW01iGFUOyTTUDEd2XUpmK_DkKDmBeCfHSw-nlCUVRkRFT5yDkxrr-qaMWxPOXrzRXQdEWbFju6F7PF3sblnRWhc2iLoNrj2kV1ttlLtbxDux333I3AWklJvfgq9udzmbverwLveju5aZFbDkEIhlvTojyPUlFqrifSjSUGjL10xTpgAq1wnXQyJUSjrauTpgaJIHCJkRaKOlTH4VYQPegkg0zfQCuSJhkKtBCJApNHookREqa4p8GfntNBy4KAOLRPOtFXOY3ztGKEa3YoBV7DtQKiGJ7AMbxYrkcOCubcesaf0SS6eHU9EENGoZIMhy4LKD9NsRfEx7-P-EprOLOiJ8fOk9HsIYEh80DFGtQmXxO9TGSiMngJN8dX3xnv9U |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Picture-Hanging+Puzzles&rft.jtitle=Theory+of+computing+systems&rft.au=Demaine%2C+Erik+D&rft.au=Demaine%2C+Martin+L&rft.au=Minsky%2C+Yair+N&rft.au=Mitchell%2C+Joseph+S%3B+B&rft.date=2014-05-01&rft.pub=Springer+Nature+B.V&rft.issn=1432-4350&rft.eissn=1433-0490&rft.volume=54&rft.issue=4&rft.spage=531&rft_id=info:doi/10.1007%2Fs00224-013-9501-0&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=3275991871 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1432-4350&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1432-4350&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1432-4350&client=summon |