{"id":"https://openalex.org/W3019062846","doi":"https://doi.org/10.1145/3446207","title":"Small Circuits and Dual Weak PHP in the Universal Theory of p-time Algorithms","display_name":"Small Circuits and Dual Weak PHP in the Universal Theory of p-time Algorithms","publication_year":2021,"publication_date":"2021-04-30","ids":{"openalex":"https://openalex.org/W3019062846","doi":"https://doi.org/10.1145/3446207","mag":"3019062846"},"language":"en","primary_location":{"id":"doi:10.1145/3446207","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3446207","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2004.11582","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jan Kraj\u00ed\u010dek","orcid":"https://orcid.org/0000-0003-0670-3957"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Jan Kraj\u00ed\u010dek","raw_affiliation_strings":["Faculty of Mathematics and Physics, Charles University"],"raw_orcid":"https://orcid.org/0000-0003-0670-3957","affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Physics, Charles University","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":null,"apc_paid":null,"fwci":0.2641,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.54827936,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":"22","issue":"2","first_page":"1","last_page":"4"},"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.6646999716758728,"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.6646999716758728,"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.06610000133514404,"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/pigeonhole-principle","display_name":"Pigeonhole principle","score":0.8726000189781189},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5989999771118164},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5008999705314636},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.4535999894142151},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4480000138282776},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4399000108242035},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.43230000138282776},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.39719998836517334}],"concepts":[{"id":"https://openalex.org/C171988527","wikidata":"https://www.wikidata.org/wiki/Q188276","display_name":"Pigeonhole principle","level":2,"score":0.8726000189781189},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6093000173568726},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5989999771118164},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5073000192642212},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5008999705314636},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4943999946117401},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.4535999894142151},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4480000138282776},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4399000108242035},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.43230000138282776},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.39719998836517334},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3910999894142151},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.3828999996185303},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3817000091075897},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.3765000104904175},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3662000000476837},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.33799999952316284},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.3230000138282776},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3172999918460846},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3158000111579895},{"id":"https://openalex.org/C111142201","wikidata":"https://www.wikidata.org/wiki/Q818930","display_name":"Computability theory","level":2,"score":0.3010999858379364},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.288100004196167},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.28189998865127563},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.26570001244544983},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2558000087738037}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3446207","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3446207","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2004.11582","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2004.11582","pdf_url":"https://arxiv.org/pdf/2004.11582","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2004.11582","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2004.11582","pdf_url":"https://arxiv.org/pdf/2004.11582","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1964394232","https://openalex.org/W2026967932","https://openalex.org/W2071204190","https://openalex.org/W2075488709","https://openalex.org/W2092429268","https://openalex.org/W2116335551","https://openalex.org/W2125894854","https://openalex.org/W4255046774"],"related_works":[],"abstract_inverted_index":{"We":[0],"prove,":[1],"under":[2],"a":[3,20,53,74],"computational":[4],"complexity":[5],"hypothesis,":[6],"that":[7,19,66],"it":[8,60],"is":[9,47,65],"consistent":[10],"with":[11],"the":[12,29,37,40,48,55,58,63],"true":[13],"universal":[14],"theory":[15],"of":[16,39,57,73],"p-time":[17,22],"algorithms":[18],"specific":[21],"function":[23,41,46,50,59],"extending":[24],"bits":[25,27],"to":[26,52],"violates":[28],"dual":[30],"weak":[31],"pigeonhole":[32],"principle:":[33],"Every":[34],"string":[35],"equals":[36],"value":[38],"for":[42],"some":[43],".":[44,78],"The":[45],"truth-table":[49],"assigning":[51],"circuit":[54],"table":[56],"computes":[61],"and":[62],"hypothesis":[64],"every":[67],"language":[68],"in":[69],"P":[70],"has":[71],"circuits":[72],"fixed":[75],"polynomial":[76],"size":[77]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2020-05-01T00:00:00"}