{"id":"https://openalex.org/W2948686875","doi":"https://doi.org/10.1145/3294052.3319704","title":"Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation","display_name":"Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation","publication_year":2019,"publication_date":"2019-06-17","ids":{"openalex":"https://openalex.org/W2948686875","doi":"https://doi.org/10.1145/3294052.3319704","mag":"2948686875"},"language":"en","primary_location":{"id":"doi:10.1145/3294052.3319704","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3294052.3319704","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011691423","display_name":"Marcelo Arenas","orcid":"https://orcid.org/0000-0003-3678-1868"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Marcelo Arenas","raw_affiliation_strings":["PUC & IMFD Chile, Santiago, Chile"],"affiliations":[{"raw_affiliation_string":"PUC & IMFD Chile, Santiago, Chile","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065267206","display_name":"Luis Alberto Croquevielle","orcid":"https://orcid.org/0009-0002-0101-4431"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luis Alberto Croquevielle","raw_affiliation_strings":["PUC & IMFD Chile, Santiago, Chile"],"affiliations":[{"raw_affiliation_string":"PUC & IMFD Chile, Santiago, Chile","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048454802","display_name":"Rajesh Jayaram","orcid":"https://orcid.org/0000-0003-0332-6332"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajesh Jayaram","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083030983","display_name":"Cristian Riveros","orcid":"https://orcid.org/0000-0003-0832-116X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cristian Riveros","raw_affiliation_strings":["PUC & IMFD Chile, Santiago, Chile"],"affiliations":[{"raw_affiliation_string":"PUC & IMFD Chile, Santiago, Chile","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5011691423"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9098,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.91864537,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"59","last_page":"73"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7702667117118835},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.6283926963806152},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6167200803756714},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.5491570830345154},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.5486016869544983},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5347002744674683},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5043538808822632},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.4876200258731842},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4848407506942749},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48335570096969604},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.45330509543418884},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.44306379556655884},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.41415104269981384},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3890921473503113},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.34359484910964966},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2406829297542572}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7702667117118835},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.6283926963806152},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6167200803756714},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.5491570830345154},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.5486016869544983},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5347002744674683},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5043538808822632},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.4876200258731842},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4848407506942749},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48335570096969604},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.45330509543418884},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.44306379556655884},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41415104269981384},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3890921473503113},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.34359484910964966},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2406829297542572},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3294052.3319704","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3294052.3319704","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1573632260","https://openalex.org/W1579803282","https://openalex.org/W1655990431","https://openalex.org/W1972917397","https://openalex.org/W1982139456","https://openalex.org/W1984509356","https://openalex.org/W2002373723","https://openalex.org/W2007940874","https://openalex.org/W2030224590","https://openalex.org/W2035744833","https://openalex.org/W2041198634","https://openalex.org/W2044504659","https://openalex.org/W2045978585","https://openalex.org/W2049316103","https://openalex.org/W2051283034","https://openalex.org/W2061042466","https://openalex.org/W2064838169","https://openalex.org/W2066720893","https://openalex.org/W2103012681","https://openalex.org/W2139236203","https://openalex.org/W2141456009","https://openalex.org/W2574453596","https://openalex.org/W2604165918","https://openalex.org/W2668736619","https://openalex.org/W2724745846","https://openalex.org/W2883227679","https://openalex.org/W2890631112","https://openalex.org/W2899548473","https://openalex.org/W2949894935","https://openalex.org/W2962679309","https://openalex.org/W2963166380","https://openalex.org/W2963265283","https://openalex.org/W2964237202","https://openalex.org/W3111890340","https://openalex.org/W4233413206","https://openalex.org/W4400025441","https://openalex.org/W6732068796"],"related_works":["https://openalex.org/W1523547988","https://openalex.org/W2147305777","https://openalex.org/W2125536734","https://openalex.org/W2144557478","https://openalex.org/W2041317738","https://openalex.org/W1982406523","https://openalex.org/W1483438220","https://openalex.org/W2000805093","https://openalex.org/W1676587966","https://openalex.org/W1638461282"],"abstract_inverted_index":{"In":[0,223],"this":[1,63,142,203,218,224,228],"work,":[2,225],"we":[3,82,91,111,117,136,226],"study":[4],"two":[5],"simple":[6],"yet":[7],"general":[8],"complexity":[9,38,66],"classes,":[10],"based":[11],"on":[12],"logspace":[13,74],"Turing":[14],"machines,":[15],"which":[16],"provide":[17],"a":[18,146,154,197,234],"unifying":[19],"framework":[20],"for":[21,44,131,159],"efficient":[22],"query":[23],"evaluation":[24],"in":[25,62,70,104,124,141,240],"areas":[26],"like":[27],"information":[28],"extraction":[29],"and":[30,49,54,90,96,99,116,127,153,231],"graph":[31],"databases,":[32],"among":[33],"others.":[34],"We":[35],"investigate":[36],"the":[37,79,84,108,163,174,184,188],"of":[39,52,72,86,102,186,190,192],"three":[40],"fundamental":[41,175],"algorithmic":[42],"problems":[43],"these":[45,168],"classes:":[46],"enumeration,":[47,95,121],"counting":[48,98,123,187],"uniform":[50,100,132,160],"generation":[51,101],"solutions,":[53],"show":[55,137,172],"that":[56,138,173,237],"they":[57],"have":[58],"several":[59],"desirable":[60],"properties":[61],"respect.":[64],"Both":[65],"classes":[67],"are":[68],"defined":[69],"terms":[71],"nondeterministic":[73,198],"transducers":[75],"(NL":[76],"transducers).":[77],"For":[78,107],"first":[80],"class,":[81,110],"consider":[83,112],"case":[85],"unambiguous":[87],"NL":[88,114],"transducers,":[89,115],"prove":[92,167],"constant":[93],"delay":[94,120],"both":[97],"solutions":[103],"polynomial":[105,119,125],"time.":[106],"second":[109,143],"unrestricted":[113],"obtain":[118,232],"approximate":[122],"time,":[126],"polynomial-time":[128,148,155],"randomized":[129,149],"algorithms":[130],"generation.":[133,161],"More":[134],"specifically,":[135],"each":[139],"problem":[140,176,185,204,219],"class":[144],"admits":[145,178,220,242],"fully":[147],"approximation":[150],"scheme":[151],"(FPRAS)":[152],"Las":[156],"Vegas":[157],"algorithm":[158],"Interestingly,":[162],"key":[164],"idea":[165],"to":[166,171,207],"results":[169],"is":[170,183,205],"#NFA":[177,182],"an":[179,221,243],"FPRAS,":[180],"where":[181],"number":[189],"strings":[191],"length":[193],"n":[194],"accepted":[195],"by":[196],"finite":[199],"automaton":[200],"(NFA).":[201],"While":[202],"known":[206],"be":[208],"#P-complete":[209],"and,":[210],"more":[211],"precisely,":[212],"SpanL-complete,":[213],"it":[214],"was":[215],"open":[216,229],"whether":[217],"FPRAS.":[222,244],"solve":[227],"problem,":[230],"as":[233],"welcome":[235],"corollary":[236],"every":[238],"function":[239],"SpanL":[241]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}