{"id":"https://openalex.org/W2096035734","doi":"https://doi.org/10.1007/3-540-45789-5_4","title":"Polynomial Constants Are Decidable","display_name":"Polynomial Constants Are Decidable","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2096035734","doi":"https://doi.org/10.1007/3-540-45789-5_4","mag":"2096035734"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45789-5_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45789-5_4","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":"book-chapter","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/A5070224469","display_name":"Markus M\u00fcller-Olm","orcid":"https://orcid.org/0009-0001-2229-9651"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Markus M\u00fcller-Olm","raw_affiliation_strings":["University of Dortmund, FB 4, LS5, 44221, Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"University of Dortmund, FB 4, LS5, 44221, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080676686","display_name":"Helmut Seidl","orcid":"https://orcid.org/0000-0002-2135-1593"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Helmut Seidl","raw_affiliation_strings":["Trier University, FB 4-Informatik, 54286, Trier, Germany"],"affiliations":[{"raw_affiliation_string":"Trier University, FB 4-Informatik, 54286, Trier, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5070224469"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.1128,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.92551996,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"4","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9991999864578247,"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/T10142","display_name":"Formal Methods in Verification","score":0.9965000152587891,"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/T11424","display_name":"Security and Verification in Computing","score":0.9954000115394592,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8132309913635254},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.760762095451355},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.7453505992889404},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5721861720085144},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44615960121154785},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44107693433761597},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4188104271888733},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32746225595474243},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.315814733505249}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8132309913635254},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.760762095451355},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7453505992889404},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5721861720085144},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44615960121154785},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44107693433761597},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4188104271888733},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32746225595474243},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.315814733505249},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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":5,"locations":[{"id":"doi:10.1007/3-540-45789-5_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45789-5_4","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.132.3807","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.3807","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www2.in.tum.de/~seidl/papers/polynomial.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.167.7721","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.167.7721","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.uni-muenster.de/sev/publications/sas02.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.7011","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.7011","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.informatik.uni-trier.de/~seidl/papers/polynomial.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.20.2748","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.2748","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ls5-www.cs.uni-dortmund.de/~mmo/pubs/sas02.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1491178396","https://openalex.org/W1518828487","https://openalex.org/W1628745019","https://openalex.org/W1857353355","https://openalex.org/W2014552079","https://openalex.org/W2020889342","https://openalex.org/W2031373197","https://openalex.org/W2032854624","https://openalex.org/W2036157748","https://openalex.org/W2043100293","https://openalex.org/W2049773063","https://openalex.org/W2065392090","https://openalex.org/W2079392836","https://openalex.org/W2084875723","https://openalex.org/W2088017390","https://openalex.org/W2103953153","https://openalex.org/W2107308446","https://openalex.org/W2114067856","https://openalex.org/W2167906874","https://openalex.org/W2203070491","https://openalex.org/W2230759561","https://openalex.org/W2612686320","https://openalex.org/W4206293930","https://openalex.org/W4234682643","https://openalex.org/W6629325410","https://openalex.org/W6631139258","https://openalex.org/W6677084613"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2583549044","https://openalex.org/W2119045600","https://openalex.org/W2584984136","https://openalex.org/W2170336571","https://openalex.org/W2962928105","https://openalex.org/W2020140696","https://openalex.org/W1485718948"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}