{"id":"https://openalex.org/W3184800508","doi":"https://doi.org/10.1145/3453417.3453422","title":"Feasibility Analysis of Conditional DAG Tasks is co-NPNP-Hard","display_name":"Feasibility Analysis of Conditional DAG Tasks is co-NPNP-Hard","publication_year":2021,"publication_date":"2021-04-07","ids":{"openalex":"https://openalex.org/W3184800508","doi":"https://doi.org/10.1145/3453417.3453422","mag":"3184800508"},"language":"en","primary_location":{"id":"doi:10.1145/3453417.3453422","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3453417.3453422","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3453417.3453422","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"29th International Conference on Real-Time Networks and Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3453417.3453422","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038442224","display_name":"Sanjoy Baruah","orcid":"https://orcid.org/0000-0002-4541-3445"},"institutions":[{"id":"https://openalex.org/I204465549","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268","country_code":"US","type":"education","lineage":["https://openalex.org/I204465549"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sanjoy Baruah","raw_affiliation_strings":["Washington University in St. Louis, USA"],"affiliations":[{"raw_affiliation_string":"Washington University in St. Louis, USA","institution_ids":["https://openalex.org/I204465549"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5038442224"],"corresponding_institution_ids":["https://openalex.org/I204465549"],"apc_list":null,"apc_paid":null,"fwci":0.9088,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.7834273,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"165","last_page":"172"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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/T10142","display_name":"Formal Methods in Verification","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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9815000295639038,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"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/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.7757806777954102},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7320379018783569},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6477627158164978},{"id":"https://openalex.org/keywords/expansive","display_name":"Expansive","score":0.5184714198112488},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5180349946022034},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.49422791600227356},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4527086615562439},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4233930706977844},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3615683913230896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.296752393245697},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18440046906471252}],"concepts":[{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.7757806777954102},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7320379018783569},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6477627158164978},{"id":"https://openalex.org/C2780502288","wikidata":"https://www.wikidata.org/wiki/Q28838156","display_name":"Expansive","level":3,"score":0.5184714198112488},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5180349946022034},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.49422791600227356},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4527086615562439},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4233930706977844},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3615683913230896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.296752393245697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18440046906471252},{"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/C30407753","wikidata":"https://www.wikidata.org/wiki/Q186191","display_name":"Compressive strength","level":2,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3453417.3453422","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3453417.3453422","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3453417.3453422","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"29th International Conference on Real-Time Networks and Systems","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3453417.3453422","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3453417.3453422","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3453417.3453422","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"29th International Conference on Real-Time Networks and Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2830720247","display_name":null,"funder_award_id":"1932530","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5263456550","display_name":null,"funder_award_id":"1814739","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6549839288","display_name":null,"funder_award_id":"CNS-1814739","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8957055485","display_name":null,"funder_award_id":"CPS-1932530","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3184800508.pdf","grobid_xml":"https://content.openalex.org/works/W3184800508.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W113754791","https://openalex.org/W586095647","https://openalex.org/W1615714516","https://openalex.org/W1625622590","https://openalex.org/W1990630852","https://openalex.org/W1996184580","https://openalex.org/W2057392949","https://openalex.org/W2065251436","https://openalex.org/W2072181151","https://openalex.org/W2089269509","https://openalex.org/W2109488193","https://openalex.org/W2156021445","https://openalex.org/W2156316099","https://openalex.org/W2167754005","https://openalex.org/W2908701640","https://openalex.org/W3034260673","https://openalex.org/W4407878857"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W1998712144","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W4300165677","https://openalex.org/W4297817344","https://openalex.org/W4292730466","https://openalex.org/W2372211403","https://openalex.org/W3164774158"],"abstract_inverted_index":{"Feasibility-analysis":[0],"algorithms":[1],"have":[2,7],"traditionally":[3],"been":[4],"required":[5],"to":[6,19,46,92],"running":[8],"times":[9],"no":[10],"worse":[11],"than":[12],"pseudo-polynomial":[13],"in":[14,17,32],"their":[15],"inputs,":[16],"order":[18],"be":[20,78],"considered":[21],"efficient.":[22],"But":[23],"this":[24,64,82],"is":[25,68,90,104],"changing:":[26],"motivated":[27],"by":[28],"a":[29,66,102],"vast":[30],"improvement":[31],"the":[33,48,58,71,93,107],"performance":[34],"of":[35,51,60,73,86],"Integer":[36],"Linear":[37],"Programming":[38],"(ILP)":[39],"solvers,":[40],"some":[41],"recent":[42],"work":[43],"has":[44],"begun":[45],"consider":[47],"limited":[49],"use":[50],"ILP":[52,117],"solvers":[53,118],"as":[54],"acceptably":[55],"efficient":[56],"for":[57,70],"purposes":[59],"feasibility":[61],"analysis.":[62],"In":[63],"paper,":[65],"characterization":[67,89],"proposed":[69],"class":[72],"feasibility-analysis":[74,108],"problems":[75,109],"that":[76,112,121],"can":[77],"solved":[79],"efficiently":[80,114],"under":[81],"more":[83],"expansive":[84],"interpretation":[85],"efficiency.":[87],"This":[88],"applied":[91],"conditional":[94],"directed":[95],"acyclic":[96],"graph":[97],"(DAG)":[98],"workload":[99],"model,":[100],"and":[101,119],"demarcation":[103],"identified":[105],"between":[106],"on":[110],"DAGs":[111],"are":[113,122],"solvable":[115],"using":[116],"those":[120],"not.":[123]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}