Publication Information

{'id': 'https://openalex.org/W2474894413', 'doi': None, 'title': 'The proof and search complexity of three combinatorial principles', 'display_name': 'The proof and search complexity of three combinatorial principles', 'publication_year': 2016, 'publication_date': '2016-01-01', 'ids': {'openalex': 'https://openalex.org/W2474894413', 'mag': '2474894413'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://escholarship.org/content/qt4b444740/qt4b444740.pdf', 'pdf_url': None, 'source': None, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'journal-article', 'indexed_in': [], 'open_access': {'is_oa': False, 'oa_status': 'closed', 'oa_url': None, 'any_repository_has_fulltext': False}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5057069922', 'display_name': 'James Aisenberg', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': True, 'raw_author_name': 'James Aisenberg', 'raw_affiliation_strings': [], 'affiliations': []}], 'institution_assertions': [], 'countries_distinct_count': 0, 'institutions_distinct_count': 0, 'corresponding_author_ids': ['https://openalex.org/A5057069922'], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.0, 'has_fulltext': False, 'cited_by_count': 0, 'citation_normalized_percentile': {'value': 0.0, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 0, 'max': 66}, 'biblio': {'volume': None, 'issue': None, 'first_page': None, 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10720', 'display_name': 'Complexity and Algorithms in Graphs', 'score': 0.9878, '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.9878, '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.9682, '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.9429, '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/lemma', 'display_name': 'Lemma (botany)', 'score': 0.85796964}, {'id': 'https://openalex.org/keywords/combinatorial-proof', 'display_name': 'Combinatorial proof', 'score': 0.71797377}, {'id': 'https://openalex.org/keywords/pigeonhole-principle', 'display_name': 'Pigeonhole principle', 'score': 0.68976784}, {'id': 'https://openalex.org/keywords/trace', 'display_name': 'TRACE (psycholinguistics)', 'score': 0.45090547}, {'id': 'https://openalex.org/keywords/proof-complexity', 'display_name': 'Proof complexity', 'score': 0.42260492}], 'concepts': [{'id': 'https://openalex.org/C2777759810', 'wikidata': 'https://www.wikidata.org/wiki/Q149316', 'display_name': 'Lemma (botany)', 'level': 3, 'score': 0.85796964}, {'id': 'https://openalex.org/C108710211', 'wikidata': 'https://www.wikidata.org/wiki/Q11538', 'display_name': 'Mathematical proof', 'level': 2, 'score': 0.8250145}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.7873552}, {'id': 'https://openalex.org/C118539577', 'wikidata': 'https://www.wikidata.org/wiki/Q3402784', 'display_name': 'Combinatorial proof', 'level': 2, 'score': 0.71797377}, {'id': 'https://openalex.org/C171988527', 'wikidata': 'https://www.wikidata.org/wiki/Q188276', 'display_name': 'Pigeonhole principle', 'level': 2, 'score': 0.68976784}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.5456056}, {'id': 'https://openalex.org/C17566778', 'wikidata': 'https://www.wikidata.org/wiki/Q467602', 'display_name': "Proofs of Fermat's little theorem", 'level': 5, 'score': 0.51626897}, {'id': 'https://openalex.org/C118615104', 'wikidata': 'https://www.wikidata.org/wiki/Q121416', 'display_name': 'Discrete mathematics', 'level': 1, 'score': 0.5161077}, {'id': 'https://openalex.org/C75291252', 'wikidata': 'https://www.wikidata.org/wiki/Q1315756', 'display_name': 'TRACE (psycholinguistics)', 'level': 2, 'score': 0.45090547}, {'id': 'https://openalex.org/C105605280', 'wikidata': 'https://www.wikidata.org/wiki/Q7249999', 'display_name': 'Proof complexity', 'level': 3, 'score': 0.42260492}, {'id': 'https://openalex.org/C146147875', 'wikidata': 'https://www.wikidata.org/wiki/Q1144897', 'display_name': 'Brouwer fixed-point theorem', 'level': 3, 'score': 0.30955547}, {'id': 'https://openalex.org/C48540410', 'wikidata': 'https://www.wikidata.org/wiki/Q5221089', 'display_name': "Danskin's theorem", 'level': 4, 'score': 0.20211002}, {'id': 'https://openalex.org/C45962547', 'wikidata': 'https://www.wikidata.org/wiki/Q1422068', 'display_name': 'Fixed-point theorem', 'level': 2, 'score': 0.10256377}, {'id': 'https://openalex.org/C18903297', 'wikidata': 'https://www.wikidata.org/wiki/Q7150', 'display_name': 'Ecology', 'level': 1, 'score': 0.0}, {'id': 'https://openalex.org/C41895202', 'wikidata': 'https://www.wikidata.org/wiki/Q8162', 'display_name': 'Linguistics', 'level': 1, 'score': 0.0}, {'id': 'https://openalex.org/C138885662', 'wikidata': 'https://www.wikidata.org/wiki/Q5891', 'display_name': 'Philosophy', 'level': 0, 'score': 0.0}, {'id': 'https://openalex.org/C2524010', 'wikidata': 'https://www.wikidata.org/wiki/Q8087', 'display_name': 'Geometry', 'level': 1, 'score': 0.0}, {'id': 'https://openalex.org/C46757340', 'wikidata': 'https://www.wikidata.org/wiki/Q43238', 'display_name': 'Poaceae', 'level': 2, 'score': 0.0}, {'id': 'https://openalex.org/C86803240', 'wikidata': 'https://www.wikidata.org/wiki/Q420', 'display_name': 'Biology', 'level': 0, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://escholarship.org/content/qt4b444740/qt4b444740.pdf', 'pdf_url': None, 'source': None, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 0, 'referenced_works': [], 'related_works': ['https://openalex.org/W76737142', 'https://openalex.org/W3014065175', 'https://openalex.org/W3004309183', 'https://openalex.org/W2952905372', 'https://openalex.org/W2790199059', 'https://openalex.org/W2604741677', 'https://openalex.org/W2460222798', 'https://openalex.org/W2267250845', 'https://openalex.org/W2254808735', 'https://openalex.org/W2170896867', 'https://openalex.org/W2169836598', 'https://openalex.org/W2139017762', 'https://openalex.org/W2036062917', 'https://openalex.org/W2033083468', 'https://openalex.org/W2014483825', 'https://openalex.org/W201195458', 'https://openalex.org/W2007819993', 'https://openalex.org/W1754605724', 'https://openalex.org/W1480202263', 'https://openalex.org/W1054254092'], 'abstract_inverted_index': {'Author(s):': [0], 'Aisenberg,': [1], 'James': [2], '|': [3, 8], 'Advisor(s):': [4], 'Buss,': [5], 'Samuel': [6], 'R': [7], 'Abstract:': [9], 'This': [10, 195], 'work': [11], 'concerns': [12], 'the': [13, 24, 28, 32, 43, 56, 72, 80, 108, 113, 137, 146, 152, 156, 168, 200, 203, 211, 215], 'propositional': [14, 37, 77], 'proof': [15, 106], 'complexity': [16, 19], 'and': [17, 31, 89, 214], 'computational': [18], 'of': [20, 26, 39, 45, 55, 71, 79, 98, 107, 116, 136, 155], "Frankl's": [21, 40, 62], 'theorem': [22, 41, 63, 82, 110], 'on': [23, 42], 'trace': [25, 44], 'sets,': [27], 'Kneser-Lovasz': [29, 81, 109, 147, 212], 'theorem,': [30, 210, 213], 'Tucker': [33, 130, 139, 143, 158, 189, 204, 217], 'lemma.We': [34], 'show': [35, 150, 166], 'that': [36, 61, 76, 111, 151, 167, 202], 'translations': [38, 78], 'sets': [46], 'has': [47, 64, 160], 'quasi-polynomial': [48, 90], 'size': [49, 66, 85, 91, 162], 'Frege': [50, 87, 92, 164], 'proofs.': [51], 'For': [52], 'constant': [53], 'values': [54, 97], 'parameter': [57], 't,': [58], 'we': [59], 'prove': [60, 75], 'polynomial': [65, 84, 161], 'AC0-Frege': [67], 'proofs': [68, 88, 93, 118], 'from': [69], 'instances': [70], 'pigeonhole': [73], 'principle.We': [74], 'have': [83], 'extended': [86, 163], 'for': [94, 119, 182, 187, 190], 'all': [95, 120, 191, 220, 231], 'fixed': [96], 'k.': [99], 'We': [100, 126, 149], 'present': [101], 'a': [102, 197], 'new': [103, 128], 'counting-based': [104], 'combinatorial': [105], 'avoids': [112], 'topological': [114], 'arguments': [115], 'prior': [117], 'but': [121], 'finitely': [122], 'many': [123], 'base': [124], 'cases.': [125], 'introduce': [127], '``truncated': [129], "lemma''": [131], 'principles,': [132], 'which': [133], 'are': [134, 219, 230], 'miniaturizations': [135], 'octahedral': [138], 'lemma.': [140], 'The': [141, 184], 'truncated': [142, 157, 216], 'lemma': [144, 159, 218], 'implies': [145], 'theorem.': [148], 'k=1': [153], 'case': [154], 'proofs.We': [165], '2-D': [169], 'TUCKER': [170], 'search': [171, 205, 226], 'problem': [172, 206], 'is': [173, 180, 207], 'PPA-hard': [174], 'under': [175, 236], 'many-one': [176, 237], 'reductions;': [177], 'therefore': [178], 'it': [179], 'complete': [181], 'PPA.': [183], 'same': [185], 'holds': [186], 'k-D': [188], 'k': [192], 'g=': [193], '2.': [194], 'corrects': [196], 'claim': [198], 'in': [199, 208], 'literature': [201], "PPAD.Frankl's": [209], 'shown': [221, 232], 'to': [222, 233], 'give': [223], 'total': [224], 'NP': [225], 'problems.': [227], 'These': [228], 'problems': [229], 'be': [234], 'PPP-hard': [235], 'reductions.': [238]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2474894413', 'counts_by_year': [], 'updated_date': '2024-12-06T19:58:26.242546', 'created_date': '2016-07-22'}