{"id":"https://openalex.org/W4416424567","doi":"https://doi.org/10.48550/arxiv.2503.22997","title":"Disjunctive Complexity","display_name":"Disjunctive Complexity","publication_year":2025,"publication_date":"2025-03-29","ids":{"openalex":"https://openalex.org/W4416424567","doi":"https://doi.org/10.48550/arxiv.2503.22997"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2503.22997","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2503.22997","pdf_url":"https://arxiv.org/pdf/2503.22997","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"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2503.22997","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120509357","display_name":"Nikita Ivanov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ivanov, Nikita","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109865266","display_name":"Alexander Rubtsov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rubtsov, Alexander","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Vyalyi, Michael","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vyalyi, Michael","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.7372000217437744,"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.7372000217437744,"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.15479999780654907,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.025499999523162842,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8452000021934509},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.680400013923645},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.6754000186920166},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.589900016784668},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5414999723434448},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.47600001096725464},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4731000065803528},{"id":"https://openalex.org/keywords/worst-case-complexity","display_name":"Worst-case complexity","score":0.47200000286102295},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4717000126838684},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42570000886917114}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8452000021934509},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.680400013923645},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6754000186920166},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6371999979019165},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.589900016784668},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5414999723434448},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4966000020503998},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.47600001096725464},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4731000065803528},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.47200000286102295},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4717000126838684},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4302999973297119},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42570000886917114},{"id":"https://openalex.org/C136726353","wikidata":"https://www.wikidata.org/wiki/Q903789","display_name":"Disjunctive normal form","level":2,"score":0.4174000024795532},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.4034000039100647},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.39469999074935913},{"id":"https://openalex.org/C122806257","wikidata":"https://www.wikidata.org/wiki/Q1063380","display_name":"PH","level":5,"score":0.39149999618530273},{"id":"https://openalex.org/C164215192","wikidata":"https://www.wikidata.org/wiki/Q13414364","display_name":"Asymptotic computational complexity","level":4,"score":0.38830000162124634},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.3880000114440918},{"id":"https://openalex.org/C93826744","wikidata":"https://www.wikidata.org/wiki/Q903738","display_name":"Game complexity","level":4,"score":0.3749000132083893},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3621000051498413},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.3578999936580658},{"id":"https://openalex.org/C24604422","wikidata":"https://www.wikidata.org/wiki/Q4828244","display_name":"Average-case complexity","level":3,"score":0.3375999927520752},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.3368000090122223},{"id":"https://openalex.org/C6435147","wikidata":"https://www.wikidata.org/wiki/Q5156627","display_name":"Complexity index","level":3,"score":0.33309999108314514},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33000001311302185},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.3027999997138977},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.30230000615119934},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.29840001463890076},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.28540000319480896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2824000120162964},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27880001068115234},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.26930001378059387},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.265500009059906},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.26429998874664307},{"id":"https://openalex.org/C176248197","wikidata":"https://www.wikidata.org/wiki/Q458526","display_name":"Probably approximately correct learning","level":4,"score":0.25690001249313354},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.25540000200271606},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2503.22997","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2503.22997","pdf_url":"https://arxiv.org/pdf/2503.22997","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"},{"id":"doi:10.48550/arxiv.2503.22997","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2503.22997","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2503.22997","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2503.22997","pdf_url":"https://arxiv.org/pdf/2503.22997","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"recently":[1],"introduced":[2],"measure":[3],"of":[4,18,24,77,91,105,113,122,131,155],"Boolean":[5,133],"functions":[6,160,176],"complexity--disjunc\\-tive":[7],"complexity":[8,13,17,23,57,79,90,167],"(DC)--is":[9],"compared":[10],"with":[11,35],"other":[12],"measures:":[14],"the":[15,22,74,88,110,153,162],"space":[16,89],"streaming":[19,93,106],"algorithms":[20,94,107,124],"and":[21,170],"nondeterministic":[25,123],"branching":[26],"programs":[27],"(NBP).":[28],"We":[29,85],"show":[30,60],"that":[31,42,61,73,87,108,125,164],"DC":[32,62],"is":[33,80,95,168],"incomparable":[34],"NBP.":[36],"Specifically,":[37],"we":[38,51,71,101,145],"present":[39],"a":[40,103,132],"function":[41],"has":[43,47],"low":[44],"NBP":[45,66,78],"but":[46],"subexponential":[48],"DC.":[49,84,99,114],"Conversely,":[50],"provide":[52],"arguments":[53],"based":[54],"on":[55],"computational":[56],"conjectures":[58],"to":[59,129,139,174],"can":[63,117],"superpolynomially":[64],"exceed":[65],"in":[67,120,150],"certain":[68],"cases.":[69],"Additionally,":[70],"prove":[72,86],"monotone":[75],"version":[76],"strictly":[81,96],"weaker":[82,97],"than":[83,98],"one-pass":[92],"Furthermore,":[100],"introduce":[102],"generalization":[104,116],"captures":[109],"full":[111],"power":[112],"This":[115],"be":[118],"expressed":[119],"terms":[121],"irreversibly":[126],"write":[127],"1s":[128],"entries":[130],"vector":[134],"(i.e.,":[135],"changes":[136],"from":[137],"1":[138],"0":[140],"are":[141],"not":[142],"allowed).":[143],"Finally,":[144],"discuss":[146],"an":[147],"unusual":[148],"phenomenon":[149],"disjunctive":[151,166],"complexity:":[152],"existence":[154],"uniformly":[156],"hard":[157],"functions.":[158],"These":[159],"exhibit":[161],"property":[163,172],"their":[165],"maximized,":[169],"this":[171],"extends":[173],"all":[175],"dominated":[177],"by":[178],"them.":[179]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}