{"id":"https://openalex.org/W1480076195","doi":"https://doi.org/10.1007/978-3-642-21581-0_4","title":"Satisfiability Certificates Verifiable in Subexponential Time","display_name":"Satisfiability Certificates Verifiable in Subexponential Time","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1480076195","doi":"https://doi.org/10.1007/978-3-642-21581-0_4","mag":"1480076195"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-21581-0_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-21581-0_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/A5020126431","display_name":"Evgeny Dantsin","orcid":"https://orcid.org/0000-0002-8753-0279"},"institutions":[{"id":"https://openalex.org/I102101047","display_name":"Roosevelt University","ror":"https://ror.org/020vmqv16","country_code":"US","type":"education","lineage":["https://openalex.org/I102101047"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Evgeny Dantsin","raw_affiliation_strings":["Department of Computer Science, Roosevelt University, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Roosevelt University, USA","institution_ids":["https://openalex.org/I102101047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035077817","display_name":"Edward Hirsch","orcid":null},"institutions":[{"id":"https://openalex.org/I2800906181","display_name":"St. Petersburg Department of Steklov Institute of Mathematics","ror":"https://ror.org/030h9s280","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I2800906181","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Edward A. Hirsch","raw_affiliation_strings":["Steklov Institute of Mathematics at St.Petersburg, Russia"],"affiliations":[{"raw_affiliation_string":"Steklov Institute of Mathematics at St.Petersburg, Russia","institution_ids":["https://openalex.org/I2800906181"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020126431"],"corresponding_institution_ids":["https://openalex.org/I102101047"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3891,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62529412,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"19","last_page":"32"},"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.9998999834060669,"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.9998999834060669,"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/T11567","display_name":"semigroups and automata theory","score":0.9991999864578247,"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.9983999729156494,"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/verifiable-secret-sharing","display_name":"Verifiable secret sharing","score":0.7844311594963074},{"id":"https://openalex.org/keywords/certificate","display_name":"Certificate","score":0.7429467439651489},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.7159290909767151},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6632805466651917},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5667429566383362},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.529058575630188},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.518902599811554},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5130009055137634},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.47052299976348877},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45172351598739624},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4479408860206604},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3964569568634033},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2997615933418274},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28040194511413574}],"concepts":[{"id":"https://openalex.org/C85847156","wikidata":"https://www.wikidata.org/wiki/Q59015987","display_name":"Verifiable secret sharing","level":3,"score":0.7844311594963074},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.7429467439651489},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.7159290909767151},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6632805466651917},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5667429566383362},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.529058575630188},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.518902599811554},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5130009055137634},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.47052299976348877},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45172351598739624},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4479408860206604},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3964569568634033},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2997615933418274},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28040194511413574},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-21581-0_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-21581-0_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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W37923608","https://openalex.org/W1498690830","https://openalex.org/W1875347116","https://openalex.org/W1920638964","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W2007121506","https://openalex.org/W2067983896","https://openalex.org/W2090871895","https://openalex.org/W2126442135","https://openalex.org/W2134514766","https://openalex.org/W2159892713","https://openalex.org/W2168704151","https://openalex.org/W2171680292","https://openalex.org/W4206807714"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W1985572324","https://openalex.org/W21597398","https://openalex.org/W4298153058","https://openalex.org/W2268872489","https://openalex.org/W1913543287","https://openalex.org/W2014111643","https://openalex.org/W2963044240","https://openalex.org/W2076399409","https://openalex.org/W2102364390"],"abstract_inverted_index":null,"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}