{"id":"https://openalex.org/W1580495489","doi":"https://doi.org/10.1007/978-3-540-28639-4_22","title":"Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms","display_name":"Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1580495489","doi":"https://doi.org/10.1007/978-3-540-28639-4_22","mag":"1580495489"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-28639-4_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-28639-4_22","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/A5016001173","display_name":"S. S. Fedin","orcid":null},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Sergey S. Fedin","raw_affiliation_strings":["Department of Mathematics and Mechanics, St.Petersburg State University, St.Petersburg, Russia"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Mechanics, St.Petersburg State University, St.Petersburg, Russia","institution_ids":["https://openalex.org/I172901346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045174507","display_name":"Alexander S. Kulikov","orcid":"https://orcid.org/0000-0002-5656-0336"},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Alexander S. Kulikov","raw_affiliation_strings":["Department of Mathematics and Mechanics, St.Petersburg State University, St.Petersburg, Russia"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Mechanics, St.Petersburg State University, St.Petersburg, Russia","institution_ids":["https://openalex.org/I172901346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016001173"],"corresponding_institution_ids":["https://openalex.org/I172901346"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.937,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.86756126,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"248","last_page":"259"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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.9975000023841858,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9972000122070312,"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/mathematical-proof","display_name":"Mathematical proof","score":0.7054769992828369},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.6858064532279968},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6837981939315796},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6058061122894287},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5495747327804565},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5394492745399475},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4996471405029297},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49916648864746094},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.42390140891075134},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28790798783302307},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.11830329895019531},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07678243517875671}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7054769992828369},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.6858064532279968},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6837981939315796},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6058061122894287},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5495747327804565},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5394492745399475},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4996471405029297},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49916648864746094},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.42390140891075134},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28790798783302307},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.11830329895019531},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07678243517875671},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-28639-4_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-28639-4_22","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W190339048","https://openalex.org/W1514793018","https://openalex.org/W1564428908","https://openalex.org/W1896404939","https://openalex.org/W1971464806","https://openalex.org/W2000579976","https://openalex.org/W2034758366","https://openalex.org/W2036185701","https://openalex.org/W2052367117","https://openalex.org/W2057361103","https://openalex.org/W2099200823","https://openalex.org/W2104216962","https://openalex.org/W2499710379","https://openalex.org/W2500252975","https://openalex.org/W2687954006","https://openalex.org/W3161295749"],"related_works":["https://openalex.org/W2154474334","https://openalex.org/W2963321374","https://openalex.org/W3034623271","https://openalex.org/W2982111769","https://openalex.org/W2610304232","https://openalex.org/W4301514548","https://openalex.org/W2301405299","https://openalex.org/W2909188079","https://openalex.org/W3124721760","https://openalex.org/W3028080309"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}