{"id":"https://openalex.org/W7138841604","doi":"https://doi.org/10.48550/arxiv.2603.17489","title":"An approximation notion between P and FPTAS","display_name":"An approximation notion between P and FPTAS","publication_year":2026,"publication_date":"2026-03-18","ids":{"openalex":"https://openalex.org/W7138841604","doi":"https://doi.org/10.48550/arxiv.2603.17489"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.17489","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.17489","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.17489","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045635626","display_name":"Samuel Bismuth","orcid":"https://orcid.org/0000-0003-3471-5402"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bismuth, Samuel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5085873807","display_name":"Erel Segal-Halevi","orcid":"https://orcid.org/0000-0002-7497-5834"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Segal-Halevi, Erel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.7501999735832214,"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.7501999735832214,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.14380000531673431,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.03009999915957451,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.39250001311302185},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.35929998755455017},{"id":"https://openalex.org/keywords/binary-relation","display_name":"Binary relation","score":0.3517000079154968},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3327000141143799},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.3255000114440918}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.652999997138977},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4198000133037567},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4027999937534332},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.39250001311302185},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.35929998755455017},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.3517000079154968},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3327000141143799},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3255000114440918},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3160000145435333},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.3003000020980835},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2703000009059906}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.17489","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.17489","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.17489","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.17489","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,38],"present":[1],"an":[2,14,21],"approximation":[3],"notion":[4,10,47],"for":[5,69],"NP-hard":[6],"optimization":[7,70],"problems.":[8],"The":[9],"is":[11,23,48,73],"based":[12],"on":[13],"*amortized":[15],"relaxation*:":[16],"the":[17,24,33,45],"relaxed":[18],"optimum":[19],"of":[20,32,77,83],"input":[22,34],"largest":[25],"per-copy":[26],"value":[27],"attainable":[28],"when":[29],"many":[30],"copies":[31],"are":[35],"solved":[36],"together.":[37],"prove":[39],"that":[40],"(assuming":[41],"P":[42,78],"!=":[43],"NP)":[44],"new":[46,65],"strictly":[49,54],"stronger":[50],"than":[51,56],"FPTAS,":[52],"but":[53],"weaker":[55],"having":[57],"a":[58,64,74,80],"polynomial-time":[59],"algorithm.":[60],"Our":[61],"results":[62],"introduce":[63],"computational":[66],"complexity":[67],"class":[68],"problems,":[71],"which":[72],"strict":[75,81],"superset":[76],"and":[79],"subset":[82],"FPTAS.":[84]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-20T00:00:00"}