{"id":"https://openalex.org/W2011047736","doi":"https://doi.org/10.1137/s0097539794282930","title":"Lower Bounds in a Parallel Model without Bit Operations","display_name":"Lower Bounds in a Parallel Model without Bit Operations","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2011047736","doi":"https://doi.org/10.1137/s0097539794282930","mag":"2011047736"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539794282930","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794282930","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5028134406","display_name":"Ketan Mulmuley","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ketan Mulmuley","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028134406"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9536,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.8517107,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"28","issue":"4","first_page":"1460","last_page":"1509"},"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.9987000226974487,"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.9987000226974487,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9965999722480774,"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/conjecture","display_name":"Conjecture","score":0.6297968626022339},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6129655241966248},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5826617479324341},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.5692543387413025},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5379989147186279},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5324262976646423},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5287413597106934},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5276718735694885},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4949464201927185},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.42374467849731445},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32036370038986206}],"concepts":[{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6297968626022339},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6129655241966248},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5826617479324341},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.5692543387413025},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5379989147186279},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5324262976646423},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5287413597106934},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5276718735694885},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4949464201927185},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.42374467849731445},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32036370038986206},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0097539794282930","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794282930","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.129.4061","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.4061","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uchicago.edu/~mulmuley/lower-bound.ps","raw_type":"text"},{"id":"pmh:oai:dsapce.library.iitb.ac.in:10054/11973","is_oa":false,"landing_page_url":"http://dspace.library.iitb.ac.in/xmlui/handle/10054/11973","pdf_url":null,"source":{"id":"https://openalex.org/S4306400899","display_name":"DSpace (IIT Bombay)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I162827531","host_organization_name":"Indian Institute of Technology Bombay","host_organization_lineage":["https://openalex.org/I162827531"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:dspace.library.iitb.ac.in:10054/11973","is_oa":false,"landing_page_url":"http://doi.org/10.1137/S0097539794282930","pdf_url":null,"source":{"id":"https://openalex.org/S4306400899","display_name":"DSpace (IIT Bombay)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I162827531","host_organization_name":"Indian Institute of Technology Bombay","host_organization_lineage":["https://openalex.org/I162827531"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W14171635","https://openalex.org/W208025404","https://openalex.org/W1512709563","https://openalex.org/W1513982482","https://openalex.org/W1558701214","https://openalex.org/W1566364654","https://openalex.org/W1568281949","https://openalex.org/W1571051474","https://openalex.org/W1572341022","https://openalex.org/W1593563200","https://openalex.org/W1971680255","https://openalex.org/W1979036815","https://openalex.org/W1981234161","https://openalex.org/W1982222968","https://openalex.org/W1991581432","https://openalex.org/W2003933590","https://openalex.org/W2006912660","https://openalex.org/W2007470648","https://openalex.org/W2012476164","https://openalex.org/W2023146810","https://openalex.org/W2025526852","https://openalex.org/W2033040247","https://openalex.org/W2038225707","https://openalex.org/W2044850435","https://openalex.org/W2045924252","https://openalex.org/W2056618053","https://openalex.org/W2056940310","https://openalex.org/W2059378738","https://openalex.org/W2059985428","https://openalex.org/W2060270693","https://openalex.org/W2068264871","https://openalex.org/W2081256023","https://openalex.org/W2090359754","https://openalex.org/W2092572272","https://openalex.org/W2097755092","https://openalex.org/W2100440346","https://openalex.org/W2103985627","https://openalex.org/W2108928028","https://openalex.org/W2113097540","https://openalex.org/W2125690626","https://openalex.org/W2136277034","https://openalex.org/W2161829873","https://openalex.org/W2165293955","https://openalex.org/W2170831059","https://openalex.org/W2294221698","https://openalex.org/W2398918824","https://openalex.org/W2503612797","https://openalex.org/W2610479830","https://openalex.org/W2610729871","https://openalex.org/W2611147814","https://openalex.org/W2963188948","https://openalex.org/W3217399827","https://openalex.org/W4235946010","https://openalex.org/W4241840173","https://openalex.org/W4293860921"],"related_works":["https://openalex.org/W238609530","https://openalex.org/W2734192830","https://openalex.org/W3016395638","https://openalex.org/W1636163329","https://openalex.org/W4292947165","https://openalex.org/W3045121788","https://openalex.org/W3201655533","https://openalex.org/W3134442314","https://openalex.org/W3127082728","https://openalex.org/W2067936666"],"abstract_inverted_index":{"We":[0],"define":[1],"a":[2,104,250,265,279],"natural":[3],"and":[4,45,94,157,187,212,249],"realistic":[5],"model":[6,13,50,138,202],"of":[7,106,163,253,256,267],"parallel":[8,39,185],"computation":[9],"called":[10],"the":[11,20,24,60,125,160,164,179,189,200,232,239,254],"PRAM":[12,22,201],"without":[14],"bit":[15,30,205],"operations.":[16],"It":[17,34,128],"is":[18,86,103,121,152,159,222],"like":[19],"usual":[21],"model,":[23],"main":[25],"difference":[26],"being":[27],"that":[28,53,130,181,263],"no":[29],"operations":[31],"are":[32],"provided.":[33],"encompasses":[35],"virtually":[36],"all":[37],"known":[38,170],"algorithms":[40],"for":[41,54,63,111,124,178,188,210,238],"(weighted)":[42],"combinatorial":[43],"optimization":[44],"algebraic":[46,226],"problems.":[47],"In":[48],"this":[49,85,174,247,260],"we":[51,90,229],"prove":[52],"some":[55,112],"large":[56,113],"enough":[57,114],"constant":[58,115,156],"b,":[59],"mincost-flow":[61],"problem":[62],"graphs":[64],"with":[65,73,141,147,203],"n":[66,77],"vertices":[67],"cannot":[68,133],"be":[69,97,134,172],"solved":[70,135],"deterministically":[71,139],"(or":[72,140],"randomization)":[74,142],"in":[75,136,143,259,278],"$\\sqrt":[76],"/b$":[78],"(expected)":[79,145],"time":[80,146],"using":[81],"$2^{\\sqrt":[82],"{n}/b}$":[83],"processors;":[84],"so":[87],"even":[88],"if":[89,101,231],"restrict":[91],"every":[92],"cost":[93],"capacity":[95],"to":[96,171,199],"an":[98,110,153],"integer":[99],"(nonnegative":[100],"it":[102],"capacity)":[105],"bitlength":[107,162],"at":[108],"most":[109],"a.":[116],"A":[117],"similar":[118],"lower":[119,195],"bound":[120],"also":[122,197,236],"proved":[123],"max-flow":[126],"problem.":[127,243],"follows":[129],"these":[131,167],"problems":[132,168],"our":[137,257],"$\\Omega(N^{c})$":[144],"$2^{\\Omega(N^{c})}$":[148],"processors,":[149],"where":[150],"c":[151],"appropriate":[154],"positive":[155],"N":[158],"total":[161],"input.":[165],"Since":[166],"were":[169],"P-complete,":[173],"provides":[175,208],"concrete":[176],"support":[177,246],"belief":[180],"P-completeness":[182],"implies":[183],"high":[184],"complexity":[186],"$P\\not":[190],"=":[191,270],"NC$":[192,271],"conjecture.":[193],"Our":[194,220,244],"bounds":[196],"extend":[198],"limited":[204],"operations,":[206],"which":[207],"instructions":[209],"parity":[211],"left":[213],"or":[214],"right":[215],"shift":[216],"by":[217],"one":[218],"bit.":[219],"proof":[221,266],"based":[223],"on":[224],"basic":[225],"geometry.":[227],"So":[228],"investigate":[230],"algebrogeometric":[233],"approach":[234],"could":[235],"work":[237],"P":[240],"versus":[241],"NC":[242],"results":[245],"possibility,":[248],"close":[251],"analysis":[252],"limitation":[255],"technique":[258],"context":[261],"suggests":[262],"such":[264],"$P":[268],"\\not":[269],"should":[272],"somehow":[273],"use":[274],"geometric":[275],"invariant":[276],"theory":[277],"deep":[280],"way.":[281]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}