{"id":"https://openalex.org/W7161267363","doi":"https://doi.org/10.4230/lipics.fun.2026.20","title":"Permutation Match Puzzles: How Young Tanvi Learned About Computational Complexity","display_name":"Permutation Match Puzzles: How Young Tanvi Learned About Computational Complexity","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7161267363","doi":"https://doi.org/10.4230/lipics.fun.2026.20"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25739","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2026.20","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol366-fun2026/LIPIcs.FUN.2026.20/LIPIcs.FUN.2026.20.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol366-fun2026/LIPIcs.FUN.2026.20/LIPIcs.FUN.2026.20.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011331683","display_name":"Kshitij Gajjar","orcid":"https://orcid.org/0000-0003-0890-199X"},"institutions":[{"id":"https://openalex.org/I65181880","display_name":"Indian Institute of Technology Hyderabad","ror":"https://ror.org/01j4v3x97","country_code":"IN","type":"education","lineage":["https://openalex.org/I65181880"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Gajjar, Kshitij","raw_affiliation_strings":["IIIT Hyderabad, India"],"raw_orcid":"https://orcid.org/0000-0003-0890-199X","affiliations":[{"raw_affiliation_string":"IIIT Hyderabad, India","institution_ids":["https://openalex.org/I65181880"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069283977","display_name":"Neeldhara Misra","orcid":"https://orcid.org/0000-0003-1727-5388"},"institutions":[{"id":"https://openalex.org/I27674431","display_name":"Indian Institute of Technology Gandhinagar","ror":"https://ror.org/0036p5w23","country_code":"IN","type":"education","lineage":["https://openalex.org/I27674431"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Misra, Neeldhara","raw_affiliation_strings":["IIT Gandhinagar, India"],"raw_orcid":"https://orcid.org/0000-0003-1727-5388","affiliations":[{"raw_affiliation_string":"IIT Gandhinagar, India","institution_ids":["https://openalex.org/I27674431"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.57022998,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.8464000225067139,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.8464000225067139,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.04749999940395355,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.041600000113248825,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.6679999828338623},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6111000180244446},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.5418000221252441},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5117999911308289},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4828000068664551},{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.4634999930858612},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.45239999890327454},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4507000148296356},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4440999925136566},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4348999857902527}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6920999884605408},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.6679999828338623},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6481000185012817},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6111000180244446},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.5418000221252441},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5117999911308289},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4828000068664551},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47760000824928284},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.4634999930858612},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.45239999890327454},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4507000148296356},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4440999925136566},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4348999857902527},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42179998755455017},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4081000089645386},{"id":"https://openalex.org/C119322782","wikidata":"https://www.wikidata.org/wiki/Q2662236","display_name":"VC dimension","level":2,"score":0.3756999969482422},{"id":"https://openalex.org/C104140500","wikidata":"https://www.wikidata.org/wiki/Q2088159","display_name":"Row and column spaces","level":3,"score":0.37459999322891235},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.36970001459121704},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3571999967098236},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.3465000092983246},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.335999995470047},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.3346000015735626},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3264000117778778},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.32589998841285706},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.31150001287460327},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.3027999997138977},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.295199990272522},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.28999999165534973},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2888000011444092},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2847999930381775},{"id":"https://openalex.org/C200985842","wikidata":"https://www.wikidata.org/wiki/Q3375503","display_name":"Random permutation","level":3,"score":0.26840001344680786},{"id":"https://openalex.org/C178481205","wikidata":"https://www.wikidata.org/wiki/Q5164372","display_name":"Constraint graph","level":5,"score":0.2540999948978424}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25739","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2026.20","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol366-fun2026/LIPIcs.FUN.2026.20/LIPIcs.FUN.2026.20.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.fun.2026.20","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fun.2026.20","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25739","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2026.20","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol366-fun2026/LIPIcs.FUN.2026.20/LIPIcs.FUN.2026.20.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320318581","display_name":"Indian Institute of Technology Gandhinagar","ror":"https://ror.org/0036p5w23"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7161267363.pdf","grobid_xml":"https://content.openalex.org/works/W7161267363.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,65],"study":[1],"a":[2,24,67,73,76,91,113,136,142,168],"family":[3],"of":[4,23,70,130],"sorting":[5],"match":[6,14],"puzzles":[7],"on":[8,98],"grids,":[9],"which":[10,88],"we":[11,105,120,140],"call":[12],"permutation":[13],"puzzles.":[15],"In":[16],"this":[17,163],"puzzle,":[18],"each":[19,58],"row":[20,59],"and":[21,42,60,79,146,156],"column":[22,61],"n":[25,27],"\u00d7":[26],"grid":[28,49],"is":[29,45,86,110,165],"labeled":[30],"with":[31,50],"an":[32,122],"ordering":[33],"constraint":[34,84],"-":[35,41],"ascending":[36],"(A)":[37],"or":[38],"descending":[39],"(D)":[40],"the":[43,48,51,99,127],"goal":[44],"to":[46,90,125,134],"fill":[47],"numbers":[52],"1":[53],"through":[54],"n\u00b2":[55],"such":[56],"that":[57,107,158],"respects":[62],"its":[63,82],"constraint.":[64],"provide":[66],"complete":[68],"characterization":[69],"solvable":[71,137],"puzzles:":[72],"puzzle":[74],"admits":[75],"solution":[77],"if":[78,81],"only":[80],"associated":[83],"graph":[85],"acyclic,":[87],"translates":[89],"simple":[92,154],"\"at":[93],"most":[94],"one":[95],"switch\"":[96],"condition":[97],"A/D":[100],"labels.":[101],"When":[102],"solutions":[103],"exist,":[104],"show":[106],"their":[108],"count":[109],"given":[111],"by":[112,167],"hook":[114],"length":[115],"formula.":[116],"For":[117],"unsolvable":[118],"puzzles,":[119],"present":[121],"O(n)":[123],"algorithm":[124],"compute":[126],"minimum":[128],"number":[129],"label":[131],"flips":[132],"required":[133],"reach":[135],"configuration.":[138],"Finally,":[139],"consider":[141],"generalization":[143],"where":[144],"rows":[145],"columns":[147],"may":[148],"specify":[149],"arbitrary":[150],"permutations":[151],"rather":[152],"than":[153],"orderings,":[155],"establish":[157],"finding":[159],"minimal":[160],"repairs":[161],"in":[162],"setting":[164],"NP-complete":[166],"reduction":[169],"from":[170],"feedback":[171],"arc":[172],"set.":[173]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-05-16T00:00:00"}