{"id":"https://openalex.org/W2073873127","doi":"https://doi.org/10.1137/0209063","title":"A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables Per Inequality","display_name":"A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables Per Inequality","publication_year":1980,"publication_date":"1980-11-01","ids":{"openalex":"https://openalex.org/W2073873127","doi":"https://doi.org/10.1137/0209063","mag":"2073873127"},"language":"en","primary_location":{"id":"doi:10.1137/0209063","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209063","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/A5034298677","display_name":"Bengt Aspvall","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bengt Aspvall","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5018292222","display_name":"Yossi Shiloach","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yossi Shiloach","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034298677"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.348,"has_fulltext":false,"cited_by_count":83,"citation_normalized_percentile":{"value":0.94649586,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"9","issue":"4","first_page":"827","last_page":"845"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7097703218460083},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6723657250404358},{"id":"https://openalex.org/keywords/linear-inequality","display_name":"Linear inequality","score":0.536969780921936},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.5127094984054565},{"id":"https://openalex.org/keywords/inequality","display_name":"Inequality","score":0.47909215092658997},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46217790246009827},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4464956521987915},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.43499821424484253},{"id":"https://openalex.org/keywords/criss-cross-algorithm","display_name":"Criss-cross algorithm","score":0.4229438006877899},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.41808056831359863},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3924591541290283},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18241682648658752},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.13918933272361755},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.10138019919395447}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7097703218460083},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6723657250404358},{"id":"https://openalex.org/C84135550","wikidata":"https://www.wikidata.org/wiki/Q3154022","display_name":"Linear inequality","level":3,"score":0.536969780921936},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.5127094984054565},{"id":"https://openalex.org/C45555294","wikidata":"https://www.wikidata.org/wiki/Q28113351","display_name":"Inequality","level":2,"score":0.47909215092658997},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46217790246009827},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4464956521987915},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.43499821424484253},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.4229438006877899},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.41808056831359863},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3924591541290283},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18241682648658752},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.13918933272361755},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.10138019919395447},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0209063","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209063","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:ADA068228","is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA068228","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC AND NTIS","raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.49000000953674316,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1967036113","https://openalex.org/W2052768371","https://openalex.org/W2072380992","https://openalex.org/W2090286414","https://openalex.org/W2164778826"],"related_works":["https://openalex.org/W2133667137","https://openalex.org/W4205348974","https://openalex.org/W2017494791","https://openalex.org/W2293098548","https://openalex.org/W2107423006","https://openalex.org/W2964424355","https://openalex.org/W2040751140","https://openalex.org/W1978355934","https://openalex.org/W1520461958","https://openalex.org/W2041443873"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,29],"constructive":[3],"algorithm":[4,24],"for":[5],"solving":[6],"systems":[7],"of":[8,22,38,43,49,53,60,77,84],"linear":[9,73],"inequalities":[10],"(LI)":[11],"with":[12],"at":[13],"most":[14],"two":[15],"variables":[16],"per":[17],"inequality.":[18],"The":[19,56,75],"time":[20,69],"complexity":[21,63],"the":[23,36,41,47,50,54],"is":[25,35,59,67,83],"$O(mn^3":[26],"I)$":[27],"on":[28],"random":[30],"access":[31],"machine,":[32],"where":[33],"m":[34],"number":[37,42],"inequalities,":[39],"n":[40],"variables,":[44],"and":[45],"I":[46],"size":[48],"binary":[51],"encoding":[52],"input.":[55],"LI":[57,78],"problem":[58],"importance":[61],"in":[62,80,87],"theory":[64],"because":[65],"it":[66],"polynomial":[68],"(Turing)":[70],"equivalent":[71],"to":[72],"programming.":[74],"subclass":[76],"treated":[79],"this":[81],"paper":[82],"practical":[85],"interest":[86],"mechanical":[88],"verification":[89],"systems.":[90]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}