{"id":"https://openalex.org/W2168352426","doi":"https://doi.org/10.1137/s0097539792235918","title":"A General Approach to Removing Degeneracies","display_name":"A General Approach to Removing Degeneracies","publication_year":1995,"publication_date":"1995-06-01","ids":{"openalex":"https://openalex.org/W2168352426","doi":"https://doi.org/10.1137/s0097539792235918","mag":"2168352426"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792235918","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792235918","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/A5087662998","display_name":"Ioannis Z. Emiris","orcid":"https://orcid.org/0000-0002-2339-5303"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ioannis Z. Emiris","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089723214","display_name":"John Canny","orcid":"https://orcid.org/0000-0002-7161-7927"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"John F. Canny","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087662998"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6699,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.89103804,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"24","issue":"3","first_page":"650","last_page":"664"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"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/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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6273590326309204},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.5874215364456177},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5207790732383728},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48093265295028687},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4717954993247986},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.47081050276756287},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47059810161590576},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4161185026168823},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.370159387588501},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19272252917289734}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6273590326309204},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5874215364456177},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5207790732383728},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48093265295028687},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4717954993247986},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47081050276756287},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47059810161590576},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4161185026168823},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.370159387588501},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19272252917289734},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539792235918","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792235918","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":18,"referenced_works":["https://openalex.org/W149384130","https://openalex.org/W256273149","https://openalex.org/W1524912379","https://openalex.org/W1563089099","https://openalex.org/W1655990431","https://openalex.org/W1974821267","https://openalex.org/W1979740015","https://openalex.org/W2001424325","https://openalex.org/W2008581147","https://openalex.org/W2026317840","https://openalex.org/W2056501879","https://openalex.org/W2071846104","https://openalex.org/W2080132708","https://openalex.org/W2501758057","https://openalex.org/W2911302472","https://openalex.org/W4210521711","https://openalex.org/W4300640952","https://openalex.org/W4301216918"],"related_works":["https://openalex.org/W4302606076","https://openalex.org/W2107287896","https://openalex.org/W4232053597","https://openalex.org/W4299987144","https://openalex.org/W4243513839","https://openalex.org/W1995337642","https://openalex.org/W2795841965","https://openalex.org/W2372877697","https://openalex.org/W2100931500","https://openalex.org/W2369578788"],"abstract_inverted_index":{"We":[0,22],"wish":[1],"to":[2,17,81,166],"increase":[3],"the":[4,32,41,46,58,63,72,82,115,128,131,149,160,174],"power":[5],"of":[6,89,130,145],"an":[7,75,141],"arbitrary":[8],"algorithm":[9,73],"designed":[10],"for":[11,34],"nondegenerate":[12],"input":[13,47],"by":[14,120,155],"allowing":[15],"it":[16],"execute":[18],"on":[19,24],"all":[20],"inputs.":[21],"concentrate":[23],"infinitesimal":[25],"symbolic":[26,107],"perturbations":[27,70],"that":[28,104],"do":[29],"not":[30],"affect":[31],"output":[33,49,64,76],"inputs":[35],"in":[36,96,127,159],"general":[37,135],"position.":[38],"Otherwise,":[39],"if":[40],"problem":[42],"mapping":[43],"is":[44,66,125,147,152],"continuous,":[45],"and":[48,62],"space":[50,65],"topology":[51],"are":[52,173],"at":[53],"least":[54],"as":[55,57],"coarse":[56],"real":[59],"euclidean":[60],"one,":[61],"connected,":[67],"then":[68,153],"our":[69],"make":[71],"produce":[74],"arbitrarily":[77,142],"close":[78],"or":[79],"identical":[80],"correct":[83],"one.":[84],"For":[85,134],"a":[86,101,121,137,156],"special":[87],"class":[88],"algorithms,":[90,136],"which":[91,124],"includes":[92],"several":[93],"important":[94],"algorithms":[95],"computational":[97],"geometry,":[98],"we":[99],"describe":[100],"deterministic":[102],"method":[103,113],"requires":[105],"no":[106],"computation.":[108],"Ignoring":[109],"polylogarithmic":[110],"factors,":[111],"this":[112],"increases":[114],"worst-case":[116,162],"bit":[117,150],"complexity":[118,151],"only":[119],"multiplicative":[122],"factor":[123],"linear":[126],"dimension":[129],"geometric":[132],"space.":[133],"randomized":[138],"scheme":[139],"with":[140],"high":[143],"probability":[144],"success":[146],"proposed;":[148],"bounded":[154],"small-degree":[157],"polynomial":[158],"original":[161],"complexity.":[163],"In":[164],"addition":[165],"being":[167],"simpler":[168],"than":[169],"previous":[170],"ones,":[171],"these":[172],"first":[175],"efficient":[176],"perturbation":[177],"methods.":[178]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}