{"id":"https://openalex.org/W1518319707","doi":"https://doi.org/10.1137/s0097539792234858","title":"A Deterministic ${\\operatorname{Poly}}(\\log \\log N)$-Time<i>N</i>-Processor Algorithm for Linear Programming in Fixed Dimension","display_name":"A Deterministic ${\\operatorname{Poly}}(\\log \\log N)$-Time<i>N</i>-Processor Algorithm for Linear Programming in Fixed Dimension","publication_year":1996,"publication_date":"1996-12-01","ids":{"openalex":"https://openalex.org/W1518319707","doi":"https://doi.org/10.1137/s0097539792234858","mag":"1518319707"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792234858","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792234858","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/A5109091195","display_name":"Mikl\u00f3s Ajtai","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Miklos Ajtai","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5019904083","display_name":"Nimrod Megiddo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nimrod Megiddo","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109091195"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5176,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.80214564,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":"6","first_page":"1171","last_page":"1195"},"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.9998000264167786,"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.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9994999766349792,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.7131257653236389},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6624504327774048},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.6443990468978882},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6441295742988586},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6136951446533203},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6067494750022888},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6023467183113098},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5292973518371582},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4995415210723877},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.404946506023407},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.38656532764434814},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3042796552181244},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26719972491264343}],"concepts":[{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.7131257653236389},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6624504327774048},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.6443990468978882},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6441295742988586},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6136951446533203},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6067494750022888},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6023467183113098},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5292973518371582},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4995415210723877},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.404946506023407},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.38656532764434814},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3042796552181244},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26719972491264343},{"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":1,"locations":[{"id":"doi:10.1137/s0097539792234858","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792234858","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W66508742","https://openalex.org/W1993058867","https://openalex.org/W1999230788","https://openalex.org/W2009436609","https://openalex.org/W2032802723","https://openalex.org/W2040783379","https://openalex.org/W2048958388","https://openalex.org/W2072783164","https://openalex.org/W2078908612","https://openalex.org/W2090133546","https://openalex.org/W2094062010","https://openalex.org/W2121284046","https://openalex.org/W2139594840"],"related_works":["https://openalex.org/W1983915440","https://openalex.org/W2055932080","https://openalex.org/W4377371889","https://openalex.org/W2018076478","https://openalex.org/W3095925971","https://openalex.org/W1992470151","https://openalex.org/W2113623403","https://openalex.org/W2887154986","https://openalex.org/W1968512104","https://openalex.org/W78560857"],"abstract_inverted_index":{"It":[0],"is":[1,36,43,54,70,79],"shown":[2],"that":[3],"for":[4,64],"any":[5],"fixed":[6],"number":[7,45],"of":[8,46],"variables,":[9],"linear-programming":[10],"problems":[11],"with":[12],"n":[13,21],"linear":[14],"inequalities":[15],"can":[16],"be":[17],"solved":[18],"deterministically":[19],"by":[20],"parallel":[22,28],"processors":[23],"in":[24],"sublogarithmic":[25],"time.":[26],"The":[27],"time":[29,68],"bound":[30,53,69],"(counting":[31],"only":[32],"the":[33,44,49,61,67],"arithmetic":[34],"operations)":[35],"$O((\\log":[37,71],"\\log":[38,72],"n)^d":[39],")$,":[40,76],"where":[41,77],"d":[42],"variables.":[47],"In":[48],"one-dimensional":[50],"case,":[51],"this":[52],"optimal.":[55],"If":[56],"we":[57],"take":[58],"into":[59],"account":[60],"operations":[62],"needed":[63],"processor":[65],"allocation,":[66],"n)^{d":[73],"+":[74],"c}":[75],"c":[78],"an":[80],"absolute":[81],"constant.":[82]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}