{"id":"https://openalex.org/W1533484093","doi":"https://doi.org/10.1007/3-540-61581-4_64","title":"The complexity of approximate optima for greatest common divisor computations","display_name":"The complexity of approximate optima for greatest common divisor computations","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W1533484093","doi":"https://doi.org/10.1007/3-540-61581-4_64","mag":"1533484093"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-61581-4_64","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-61581-4_64","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5059014798","display_name":"Carsten R\u00f6ssner","orcid":null},"institutions":[{"id":"https://openalex.org/I114090438","display_name":"Goethe University Frankfurt","ror":"https://ror.org/04cvxnb49","country_code":"DE","type":"education","lineage":["https://openalex.org/I114090438"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Carsten R\u00f6ssner","raw_affiliation_strings":["Dept. of Math. Comp. Science, University of Frankfurt, P.O. Box 111932, 60054, Frankfurt/Main, Germany","University of Frankfurt"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Math. Comp. Science, University of Frankfurt, P.O. Box 111932, 60054, Frankfurt/Main, Germany","institution_ids":["https://openalex.org/I114090438"]},{"raw_affiliation_string":"University of Frankfurt","institution_ids":["https://openalex.org/I114090438"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001159554","display_name":"Jean\u2010Pierre Seifert","orcid":"https://orcid.org/0000-0002-5372-4825"},"institutions":[{"id":"https://openalex.org/I114090438","display_name":"Goethe University Frankfurt","ror":"https://ror.org/04cvxnb49","country_code":"DE","type":"education","lineage":["https://openalex.org/I114090438"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jean-Pierre Seifert","raw_affiliation_strings":["Dept. of Math. Comp. Science, University of Frankfurt, P.O. Box 111932, 60054, Frankfurt/Main, Germany","University of Frankfurt"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Math. Comp. Science, University of Frankfurt, P.O. Box 111932, 60054, Frankfurt/Main, Germany","institution_ids":["https://openalex.org/I114090438"]},{"raw_affiliation_string":"University of Frankfurt","institution_ids":["https://openalex.org/I114090438"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I114090438"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"307","last_page":"322"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9811999797821045,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/greatest-common-divisor","display_name":"Greatest common divisor","score":0.7357869744300842},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7314562797546387},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6636033654212952},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6227430105209351},{"id":"https://openalex.org/keywords/multiplier","display_name":"Multiplier (economics)","score":0.5294525027275085},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4869721829891205},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.48690974712371826},{"id":"https://openalex.org/keywords/euclidean-algorithm","display_name":"Euclidean algorithm","score":0.4635791778564453},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4571641683578491},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.455575168132782},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4112406373023987},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2823130786418915},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.2742874026298523},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.18689227104187012}],"concepts":[{"id":"https://openalex.org/C125257309","wikidata":"https://www.wikidata.org/wiki/Q131752","display_name":"Greatest common divisor","level":2,"score":0.7357869744300842},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7314562797546387},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6636033654212952},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6227430105209351},{"id":"https://openalex.org/C124584101","wikidata":"https://www.wikidata.org/wiki/Q1053266","display_name":"Multiplier (economics)","level":2,"score":0.5294525027275085},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4869721829891205},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.48690974712371826},{"id":"https://openalex.org/C98371066","wikidata":"https://www.wikidata.org/wiki/Q230848","display_name":"Euclidean algorithm","level":2,"score":0.4635791778564453},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4571641683578491},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.455575168132782},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4112406373023987},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2823130786418915},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2742874026298523},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.18689227104187012},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C139719470","wikidata":"https://www.wikidata.org/wiki/Q39680","display_name":"Macroeconomics","level":1,"score":0.0},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/3-540-61581-4_64","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-61581-4_64","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.4000","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.4000","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mi.informatik.uni-frankfurt.de/people/schnorr/luckhard/schnorr/bloemer/roessner/papers/ants96.ps","raw_type":"text"},{"id":"pmh:oai:publikationen.ub.uni-frankfurt.de:3820","is_oa":false,"landing_page_url":"http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/3820","pdf_url":null,"source":{"id":"https://openalex.org/S4306400432","display_name":"Publication Server of Goethe University Frankfurt am Main (Goethe University Frankfurt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114090438","host_organization_name":"Goethe University Frankfurt","host_organization_lineage":["https://openalex.org/I114090438"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1511716344","https://openalex.org/W1529753904","https://openalex.org/W1595252626","https://openalex.org/W1606480398","https://openalex.org/W1975442866","https://openalex.org/W2000869424","https://openalex.org/W2007997869","https://openalex.org/W2010879862","https://openalex.org/W2015101476","https://openalex.org/W2016232593","https://openalex.org/W2019960571","https://openalex.org/W2027157239","https://openalex.org/W2059453880","https://openalex.org/W2066356146","https://openalex.org/W2132302072","https://openalex.org/W2157054705","https://openalex.org/W6644040475"],"related_works":["https://openalex.org/W2088158977","https://openalex.org/W1974100545","https://openalex.org/W2407321536","https://openalex.org/W2086059606","https://openalex.org/W1846361160","https://openalex.org/W2021372200","https://openalex.org/W2314909417","https://openalex.org/W1992470151","https://openalex.org/W2101153990","https://openalex.org/W2046347355"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}