{"id":"https://openalex.org/W2166684353","doi":"https://doi.org/10.37236/104","title":"The Complexity of Constructing Gerechte Designs","display_name":"The Complexity of Constructing Gerechte Designs","publication_year":2009,"publication_date":"2009-01-30","ids":{"openalex":"https://openalex.org/W2166684353","doi":"https://doi.org/10.37236/104","mag":"2166684353"},"language":"en","primary_location":{"id":"doi:10.37236/104","is_oa":true,"landing_page_url":"https://doi.org/10.37236/104","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r15/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r15/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031918862","display_name":"Emil R. Vaughan","orcid":null},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"E. R. Vaughan","raw_affiliation_strings":["School of Mathematical Sciences, Queen Mary, University of London, UK"],"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Queen Mary, University of London, UK","institution_ids":["https://openalex.org/I166337079"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031918862"],"corresponding_institution_ids":["https://openalex.org/I166337079"],"apc_list":null,"apc_paid":null,"fwci":2.1337,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.88385162,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"16","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11798","display_name":"Optimal Experimental Design Methods","score":0.9904999732971191,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9898999929428101,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8039021492004395},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.793872594833374},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7719601988792419},{"id":"https://openalex.org/keywords/symbol","display_name":"Symbol (formal)","score":0.4860139489173889},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.477300763130188},{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.465728223323822},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43370482325553894},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.154812753200531}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8039021492004395},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.793872594833374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7719601988792419},{"id":"https://openalex.org/C134400042","wikidata":"https://www.wikidata.org/wiki/Q2372244","display_name":"Symbol (formal)","level":2,"score":0.4860139489173889},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.477300763130188},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.465728223323822},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43370482325553894},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.154812753200531},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/104","is_oa":true,"landing_page_url":"https://doi.org/10.37236/104","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r15/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.214.4399","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.214.4399","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_16/PDF/v16i1r15.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/104","is_oa":true,"landing_page_url":"https://doi.org/10.37236/104","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r15/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2166684353.pdf","grobid_xml":"https://content.openalex.org/works/W2166684353.grobid-xml"},"referenced_works_count":6,"referenced_works":["https://openalex.org/W2011039300","https://openalex.org/W2068508408","https://openalex.org/W2083140445","https://openalex.org/W2102669784","https://openalex.org/W2402297725","https://openalex.org/W4391177866"],"related_works":["https://openalex.org/W2389793738","https://openalex.org/W2376208682","https://openalex.org/W4246219814","https://openalex.org/W4240806619","https://openalex.org/W2368886944","https://openalex.org/W1598028160","https://openalex.org/W1519201794","https://openalex.org/W1629505938","https://openalex.org/W2767824041","https://openalex.org/W1987322712"],"abstract_inverted_index":{"Gerechte":[0],"designs":[1,91],"are":[2,42],"a":[3,22,66,71],"specialisation":[4],"of":[5,24,27,33,63,74],"latin":[6],"squares.":[7],"A":[8],"gerechte":[9,67,90],"design":[10,68],"is":[11,77,83],"an":[12],"$n\\times":[13],"n$":[14],"array":[15,29],"containing":[16],"the":[17,25,28,40,61,75],"symbols":[18],"$\\{1,\\dots,n\\}$,":[19],"together":[20],"with":[21,92],"partition":[23,73],"cells":[26,35,41,76],"into":[30],"$n$":[31,34],"regions":[32],"each.":[36],"The":[37],"entries":[38],"in":[39],"required":[43],"to":[44],"be":[45],"such":[46],"that":[47,60,81],"each":[48,54],"row,":[49],"column":[50],"and":[51],"region":[52],"contains":[53],"symbol":[55],"exactly":[56],"once.":[57],"We":[58],"show":[59],"problem":[62],"deciding":[64],"if":[65],"exists":[69],"for":[70,88],"given":[72],"NP-complete.":[78],"It":[79],"follows":[80],"there":[82],"no":[84],"polynomial":[85],"time":[86],"algorithm":[87],"finding":[89],"specified":[93],"partitions":[94],"unless":[95],"P=NP.":[96]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}