{"id":"https://openalex.org/W2615326312","doi":"https://doi.org/10.1145/3070902","title":"Min/Max-Poly Weighting Schemes and the NL versus UL Problem","display_name":"Min/Max-Poly Weighting Schemes and the NL versus UL Problem","publication_year":2017,"publication_date":"2017-05-12","ids":{"openalex":"https://openalex.org/W2615326312","doi":"https://doi.org/10.1145/3070902","mag":"2615326312"},"language":"en","primary_location":{"id":"doi:10.1145/3070902","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3070902","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-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/A5022585552","display_name":"Anant Dhayal","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"education","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Anant Dhayal","raw_affiliation_strings":["Indian Institute of Technology Madras, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001731932","display_name":"Jayalal Sarma","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"education","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Jayalal Sarma","raw_affiliation_strings":["Indian Institute of Technology Madras, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074374806","display_name":"Saurabh Sawlani","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"education","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Saurabh Sawlani","raw_affiliation_strings":["Indian Institute of Technology Madras, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I24676775"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08223439,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":"2","first_page":"1","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9819999933242798,"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/weighting","display_name":"Weighting","score":0.7623825669288635},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7046035528182983},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6868684887886047},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.675744354724884},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.573982298374176},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4522935152053833},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4178295135498047},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3939807415008545},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3463454842567444}],"concepts":[{"id":"https://openalex.org/C183115368","wikidata":"https://www.wikidata.org/wiki/Q856577","display_name":"Weighting","level":2,"score":0.7623825669288635},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7046035528182983},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6868684887886047},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.675744354724884},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.573982298374176},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4522935152053833},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4178295135498047},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3939807415008545},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3463454842567444},{"id":"https://openalex.org/C126838900","wikidata":"https://www.wikidata.org/wiki/Q77604","display_name":"Radiology","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3070902","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3070902","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W987035227","https://openalex.org/W1527197079","https://openalex.org/W1590283810","https://openalex.org/W1597166809","https://openalex.org/W1772007397","https://openalex.org/W2014352902","https://openalex.org/W2043360684","https://openalex.org/W2072560800","https://openalex.org/W2112149344","https://openalex.org/W2139236203","https://openalex.org/W2165621523","https://openalex.org/W2166162093","https://openalex.org/W2611093227","https://openalex.org/W2786225953","https://openalex.org/W4232896595","https://openalex.org/W4298227433"],"related_works":["https://openalex.org/W2127267268","https://openalex.org/W2136512912","https://openalex.org/W2067910792","https://openalex.org/W2156446763","https://openalex.org/W2143461633","https://openalex.org/W2889071233","https://openalex.org/W4321471459","https://openalex.org/W4221156924","https://openalex.org/W2380814829","https://openalex.org/W4301046126"],"abstract_inverted_index":{"For":[0],"a":[1,16,22,35,54,70,109,136,151,189,209,229,261,308,314],"graph":[2,49],"G":[3,50],"(":[4,25],"V":[5,10,20],",":[6,21,51,66,102],"E":[7,28],")":[8,14,32,39,113,340],"(|":[9],"|":[11],"=":[12,329],"n":[13,96],"and":[15,146,173,182,184,272,311],"vertex":[17,45],"s":[18,63],"\u2208":[19],"weighting":[23,40,105,114,138,161,241,316,341],"scheme":[24,41,106,162],"W":[26],":":[27],"\u21a6":[29],"Z":[30],"+":[31],"is":[33,53,72,93,107,163,324],"called":[34,108],"min-unique":[36,164],"(resp.":[37,59,90,111],"max-unique":[38,271,315],"if,":[42],"for":[43,98,127,156,232,258,300,343],"any":[44],"v":[46,65],"of":[47,57,69,75,86,88,130,177,224,275,321],"the":[48,73,76,80,84,104,128,142,157,160,175,216,221,225,254,266,270,276,283,295,301],"there":[52],"unique":[55,262,309],"path":[56,71,256,303],"minimum":[58,89],"maximum)":[60,91],"weight":[61,68,92],"from":[62],"to":[64,79,193,214,253,326,333],"where":[67],"sum":[74],"weights":[77],"assigned":[78],"edges.":[81],"Instead,":[82],"if":[83],"number":[85],"paths":[87],"bounded":[94],"by":[95],"c":[97,101],"some":[99],"constant":[100],"then":[103],"min-poly":[110,137,337],"max-poly":[112,240,273,339],"scheme.":[115,139,317],"In":[116],"this":[117,207],"article,":[118],"we":[119,227,246,281],"propose":[120,228],"an":[121],"unambiguous":[122,211],"nondeterministic":[123],"log-space":[124,335],"(UL)":[125],"algorithm":[126,153,231,297],"problem":[129,257,304],"testing":[131,233],"reachability":[132,234,249],"graphs":[133],"augmented":[134,238,312],"with":[135,188,208,239,260,307,313],"This":[140],"improves":[141],"result":[143],"in":[144,149,200,235,250,288,293],"Reinhardt":[145,183],"Allender":[147,185],"[2000],":[148,186],"which":[150,294],"UL":[152,218,230,296],"was":[154,298],"given":[155,299],"case":[158],"when":[159],".":[165],"Our":[166],"main":[167],"technique":[168,191],"involves":[169],"triple":[170],"inductive":[171,285],"counting":[172,286],"generalizes":[174],"techniques":[176],"Immerman":[178],"[1988],":[179,181],"Szelepcs\u00e9nyi":[180],"combined":[187],"hashing":[190],"due":[192],"Fredman":[194],"et":[195,202,290],"al.":[196,203,291],"[1984]":[197],"(also":[198],"used":[199],"Garvin":[201],"[2014]).":[204],"We":[205],"combine":[206],"complementary":[210],"verification":[212],"method":[213,287],"give":[215],"desired":[217],"algorithm.":[219],"At":[220],"other":[222],"end":[223],"spectrum,":[226],"layered":[236,251,344],"DAGs":[237,252,259,306],"schemes.":[242],"To":[243],"achieve":[244],"this,":[245],"first":[247],"reduce":[248],"longest":[255,302],"source,":[263],"such":[264],"that":[265],"reduction":[267],"also":[268],"preserves":[269],"properties":[274],"graph.":[277],"Using":[278],"our":[279,322],"techniques,":[280],"generalize":[282],"double":[284],"Limaye":[289],"[2009],":[292],"on":[305],"sink":[310],"An":[318],"important":[319],"consequence":[320],"results":[323],"that,":[325],"show":[327],"NL":[328],"UL,":[330],"it":[331],"suffices":[332],"design":[334],"computable":[336],"(or":[338],"schemes":[342],"DAGs.":[345]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}