{"id":"https://openalex.org/W385421650","doi":"https://doi.org/10.1007/978-3-319-08019-2_24","title":"Predicate Characterizations in the Polynomial-Size Hierarchy","display_name":"Predicate Characterizations in the Polynomial-Size Hierarchy","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W385421650","doi":"https://doi.org/10.1007/978-3-319-08019-2_24","mag":"385421650"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-08019-2_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-08019-2_24","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/A5023928618","display_name":"Christos A. Kapoutsis","orcid":"https://orcid.org/0000-0001-8963-9326"},"institutions":[{"id":"https://openalex.org/I4210089979","display_name":"Carnegie Mellon University Qatar","ror":"https://ror.org/00az5dt38","country_code":"QA","type":"education","lineage":["https://openalex.org/I4210089979","https://openalex.org/I74973139"]}],"countries":["QA"],"is_corresponding":true,"raw_author_name":"Christos A. Kapoutsis","raw_affiliation_strings":["Carnegie Mellon University in Qatar, Qatar"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University in Qatar, Qatar","institution_ids":["https://openalex.org/I4210089979"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023928618"],"corresponding_institution_ids":["https://openalex.org/I4210089979"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.1082112,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"234","last_page":"244"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"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/T11567","display_name":"semigroups and automata theory","score":1.0,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.998199999332428,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9979000091552734,"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/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.685307502746582},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6694150567054749},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.6405526399612427},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.6366705894470215},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.6166617274284363},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.574658215045929},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5106726288795471},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5052812695503235},{"id":"https://openalex.org/keywords/analytical-hierarchy","display_name":"Analytical hierarchy","score":0.5024168491363525},{"id":"https://openalex.org/keywords/monic-polynomial","display_name":"Monic polynomial","score":0.4845370650291443},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4665951728820801},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4604080617427826},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.4318240284919739},{"id":"https://openalex.org/keywords/first-order-logic","display_name":"First-order logic","score":0.4138990640640259},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.401865690946579},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18348702788352966},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.14568179845809937},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.12601003050804138}],"concepts":[{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.685307502746582},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6694150567054749},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.6405526399612427},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.6366705894470215},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.6166617274284363},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.574658215045929},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5106726288795471},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5052812695503235},{"id":"https://openalex.org/C176053320","wikidata":"https://www.wikidata.org/wiki/Q2878515","display_name":"Analytical hierarchy","level":3,"score":0.5024168491363525},{"id":"https://openalex.org/C163635466","wikidata":"https://www.wikidata.org/wiki/Q3099696","display_name":"Monic polynomial","level":3,"score":0.4845370650291443},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4665951728820801},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4604080617427826},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.4318240284919739},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.4138990640640259},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.401865690946579},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18348702788352966},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.14568179845809937},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.12601003050804138},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C87345402","wikidata":"https://www.wikidata.org/wiki/Q485202","display_name":"Analytic hierarchy process","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-319-08019-2_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-08019-2_24","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":13,"referenced_works":["https://openalex.org/W63776376","https://openalex.org/W596942210","https://openalex.org/W1497278126","https://openalex.org/W1500042303","https://openalex.org/W1994584977","https://openalex.org/W2007464118","https://openalex.org/W2034243894","https://openalex.org/W2061996338","https://openalex.org/W2065251436","https://openalex.org/W2090553158","https://openalex.org/W3127113455","https://openalex.org/W4205333439","https://openalex.org/W4236835455"],"related_works":["https://openalex.org/W1520700928","https://openalex.org/W2798907744","https://openalex.org/W1504200807","https://openalex.org/W4236887310","https://openalex.org/W1999609654","https://openalex.org/W2951313060","https://openalex.org/W2169625092","https://openalex.org/W4300950794","https://openalex.org/W2911798073","https://openalex.org/W385421650"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}