{"id":"https://openalex.org/W4415263847","doi":"https://doi.org/10.3390/sym17101745","title":"Tossing Coins with an \ud835\udca9\ud835\udcab-Machine","display_name":"Tossing Coins with an \ud835\udca9\ud835\udcab-Machine","publication_year":2025,"publication_date":"2025-10-16","ids":{"openalex":"https://openalex.org/W4415263847","doi":"https://doi.org/10.3390/sym17101745"},"language":"en","primary_location":{"id":"doi:10.3390/sym17101745","is_oa":true,"landing_page_url":"https://doi.org/10.3390/sym17101745","pdf_url":null,"source":{"id":"https://openalex.org/S190787756","display_name":"Symmetry","issn_l":"2073-8994","issn":["2073-8994"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Symmetry","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.3390/sym17101745","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022880347","display_name":"Edgar G. Daylight","orcid":"https://orcid.org/0000-0002-9815-3966"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Edgar Graham Daylight","raw_affiliation_strings":["a.k.a. Karel Van Oudheusden, Department of Computer Science, KU Leuven, Celestijnenlaan 200a, Box 2402, 3001 Leuven, Belgium"],"raw_orcid":"https://orcid.org/0000-0002-9815-3966","affiliations":[{"raw_affiliation_string":"a.k.a. Karel Van Oudheusden, Department of Computer Science, KU Leuven, Celestijnenlaan 200a, Box 2402, 3001 Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5022880347"],"corresponding_institution_ids":["https://openalex.org/I99464096"],"apc_list":{"value":2000,"currency":"CHF","value_usd":2165},"apc_paid":{"value":2000,"currency":"CHF","value_usd":2165},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.28668638,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"10","first_page":"1745","last_page":"1745"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9370999932289124,"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"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9370999932289124,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6880000233650208},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5083000063896179},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4862000048160553},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46149998903274536},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.4133000075817108},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.40849998593330383},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4025000035762787},{"id":"https://openalex.org/keywords/scope","display_name":"Scope (computer science)","score":0.39259999990463257},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.3853999972343445}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6880000233650208},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5103999972343445},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5083000063896179},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4862000048160553},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46149998903274536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4553000032901764},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.4133000075817108},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.40849998593330383},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4025000035762787},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39399999380111694},{"id":"https://openalex.org/C2778012447","wikidata":"https://www.wikidata.org/wiki/Q1034415","display_name":"Scope (computer science)","level":2,"score":0.39259999990463257},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.3853999972343445},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3840000033378601},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.382099986076355},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.37959998846054077},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.36000001430511475},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35839998722076416},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35679998993873596},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.3537999987602234},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3449999988079071},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.3305000066757202},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.31380000710487366},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.305400013923645},{"id":"https://openalex.org/C184596265","wikidata":"https://www.wikidata.org/wiki/Q2651576","display_name":"Model of computation","level":3,"score":0.29789999127388},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.28200000524520874},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.27149999141693115},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.2612999975681305},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.25850000977516174},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.25619998574256897},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.25290000438690186}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/sym17101745","is_oa":true,"landing_page_url":"https://doi.org/10.3390/sym17101745","pdf_url":null,"source":{"id":"https://openalex.org/S190787756","display_name":"Symmetry","issn_l":"2073-8994","issn":["2073-8994"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Symmetry","raw_type":"journal-article"},{"id":"pmh:oai:lirias2repo.kuleuven.be:20.500.12942/774203","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/20.500.12942/774203","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Symmetry-Basel, vol. 17 (10), Art.No. 1745","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.3390/sym17101745","is_oa":true,"landing_page_url":"https://doi.org/10.3390/sym17101745","pdf_url":null,"source":{"id":"https://openalex.org/S190787756","display_name":"Symmetry","issn_l":"2073-8994","issn":["2073-8994"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Symmetry","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W574734723","https://openalex.org/W1638203394","https://openalex.org/W2011992362","https://openalex.org/W2119293933","https://openalex.org/W2134140745","https://openalex.org/W2152025308","https://openalex.org/W2555400340","https://openalex.org/W2743299449","https://openalex.org/W4211234620","https://openalex.org/W4214663775","https://openalex.org/W4246976488","https://openalex.org/W4410028933","https://openalex.org/W4411872956"],"related_works":[],"abstract_inverted_index":{"In":[0,63,78],"computational":[1],"complexity,":[2],"a":[3,6,13,68,74,97,103],"tableau":[4,25,46,142],"represents":[5],"hypothetical":[7],"accepting":[8],"computation":[9],"path":[10],"p":[11],"of":[12,59,71,85,110,140,146,157,183],"nondeterministic":[14],"polynomial":[15,104],"time":[16],"Turing":[17],"machine":[18],"N":[19,60],"on":[20,61],"an":[21],"input":[22],"w.":[23,62],"The":[24,35,130],"is":[26],"encoded":[27],"by":[28,149,168],"the":[29,39,45,56,83,118,141,144,155,181],"formula":[30],"\u03c8,":[31],"defined":[32],"as":[33,73],"\u03c8=\u03c8cell\u2227\u03c8rest.":[34],"component":[36],"\u03c8cell":[37],"enforces":[38],"constraint":[40],"that":[41],"each":[42,125],"cell":[43],"in":[44,143,154],"contains":[47],"exactly":[48],"one":[49],"symbol,":[50],"while":[51],"\u03c8rest":[52,72],"incorporates":[53],"constraints":[54,153],"governing":[55],"step-by-step":[57],"behavior":[58],"recent":[64],"work,":[65],"we":[66,81,95],"reformulated":[67],"critical":[69],"part":[70],"compact":[75],"Horn":[76],"formula.":[77],"another":[79],"paper,":[80],"evaluated":[82],"cost":[84],"this":[86,184],"reformulation,":[87],"though":[88],"our":[89,111],"estimates":[90],"were":[91],"intentionally":[92],"conservative.":[93],"Here,":[94],"provide":[96],"more":[98],"rigorous":[99],"analysis":[100],"and":[101,121,148],"derive":[102],"bound":[105],"for":[106],"two":[107],"enhanced":[108],"variants":[109],"original":[112],"Filling":[113],"Holes":[114],"with":[115,127],"Backtracking":[116],"algorithm:":[117],"refined":[119],"(rFHB)":[120],"streamlined":[122],"(sFHB)":[123],"versions,":[124],"tasked":[126],"solving":[128],"3-SAT.":[129],"improvements":[131,160],"stem":[132],"from":[133],"exploiting":[134],"inter-cell":[135],"dependencies":[136],"spanning":[137],"large":[138],"regions":[139],"case":[145,156],"rFHB,":[147],"incorporating":[150],"correlated":[151],"coin-tossing":[152],"sFHB.":[158],"These":[159],"are":[161],"purely":[162],"conceptual;":[163],"no":[164],"empirical":[165],"validation\u2014commonly":[166],"expected":[167],"complexity":[169],"specialists\u2014is":[170],"provided.":[171],"Accordingly,":[172],"any":[173],"claim":[174],"regarding":[175],"P":[176],"vs.":[177],"NP":[178],"remains":[179],"beyond":[180],"scope":[182],"work.":[185]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-17T00:00:00"}