Publication Information

{'id': 'https://openalex.org/W2101153990', 'doi': 'https://doi.org/10.1109/ccc.2000.856730', 'title': 'Time-space tradeoffs for nondeterministic computation', 'display_name': 'Time-space tradeoffs for nondeterministic computation', 'publication_year': 2002, 'publication_date': '2002-11-07', 'ids': {'openalex': 'https://openalex.org/W2101153990', 'doi': 'https://doi.org/10.1109/ccc.2000.856730', 'mag': '2101153990'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1109/ccc.2000.856730', 'pdf_url': None, 'source': None, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'proceedings-article', 'indexed_in': ['crossref'], '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/A5075191567', 'display_name': 'Lance Fortnow', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I20089843', 'display_name': 'Princeton University', 'ror': 'https://ror.org/00hx57361', 'country_code': 'US', 'type': 'education', 'lineage': ['https://openalex.org/I20089843']}], 'countries': ['US'], 'is_corresponding': False, 'raw_author_name': 'L. Fortnow', 'raw_affiliation_strings': ['NEC Res. Inst., Princeton, NJ, USA#TAB#'], 'affiliations': [{'raw_affiliation_string': 'NEC Res. Inst., Princeton, NJ, USA#TAB#', 'institution_ids': ['https://openalex.org/I20089843']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5111961315', 'display_name': 'Dieter van Melkebeek', 'orcid': None}, 'institutions': [{'id': 'https://openalex.org/I2799411422', 'display_name': 'Center for Discrete Mathematics and Theoretical Computer Science', 'ror': 'https://ror.org/00k551w06', 'country_code': 'US', 'type': 'facility', 'lineage': ['https://openalex.org/I102322142', 'https://openalex.org/I118347220', 'https://openalex.org/I1283103587', 'https://openalex.org/I1311060795', 'https://openalex.org/I20089843', 'https://openalex.org/I2799411422', 'https://openalex.org/I4210107353']}], 'countries': ['US'], 'is_corresponding': False, 'raw_author_name': 'D. van Melkebeek', 'raw_affiliation_strings': ['[DIMACS Center, Piscataway, NJ, USA]'], 'affiliations': [{'raw_affiliation_string': '[DIMACS Center, Piscataway, NJ, USA]', 'institution_ids': ['https://openalex.org/I2799411422']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 2, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 2.81, 'has_fulltext': True, 'fulltext_origin': 'ngrams', 'cited_by_count': 34, 'citation_normalized_percentile': {'value': 0.928669, 'is_in_top_1_percent': False, 'is_in_top_10_percent': True}, 'cited_by_percentile_year': {'min': 89, 'max': 90}, 'biblio': {'volume': None, 'issue': None, 'first_page': '2', 'last_page': '13'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T11567', 'display_name': 'semigroups and automata theory', 'score': 0.9993, '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': 0.9993, '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.9988, '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.9959, '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/nondeterministic-algorithm', 'display_name': 'Nondeterministic algorithm', 'score': 0.8804624}, {'id': 'https://openalex.org/keywords/dtime', 'display_name': 'DTIME', 'score': 0.72937787}, {'id': 'https://openalex.org/keywords/sublinear-function', 'display_name': 'Sublinear function', 'score': 0.6634662}, {'id': 'https://openalex.org/keywords/time-hierarchy-theorem', 'display_name': 'Time hierarchy theorem', 'score': 0.65095997}, {'id': 'https://openalex.org/keywords/linear-space', 'display_name': 'Linear space', 'score': 0.4868857}, {'id': 'https://openalex.org/keywords/constant', 'display_name': 'Constant (computer programming)', 'score': 0.43749514}, {'id': 'https://openalex.org/keywords/satisfiability', 'display_name': 'Satisfiability', 'score': 0.4356546}], 'concepts': [{'id': 'https://openalex.org/C176181172', 'wikidata': 'https://www.wikidata.org/wiki/Q3490301', 'display_name': 'Nondeterministic algorithm', 'level': 2, 'score': 0.8804624}, {'id': 'https://openalex.org/C15547884', 'wikidata': 'https://www.wikidata.org/wiki/Q1155831', 'display_name': 'DTIME', 'level': 5, 'score': 0.72937787}, {'id': 'https://openalex.org/C117160843', 'wikidata': 'https://www.wikidata.org/wiki/Q338652', 'display_name': 'Sublinear function', 'level': 2, 'score': 0.6634662}, {'id': 'https://openalex.org/C29248071', 'wikidata': 'https://www.wikidata.org/wiki/Q163310', 'display_name': 'Turing machine', 'level': 3, 'score': 0.6554543}, {'id': 'https://openalex.org/C48415503', 'wikidata': 'https://www.wikidata.org/wiki/Q5251122', 'display_name': 'Time hierarchy theorem', 'level': 5, 'score': 0.65095997}, {'id': 'https://openalex.org/C311688', 'wikidata': 'https://www.wikidata.org/wiki/Q2393193', 'display_name': 'Time complexity', 'level': 2, 'score': 0.60938776}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.59581435}, {'id': 'https://openalex.org/C118615104', 'wikidata': 'https://www.wikidata.org/wiki/Q121416', 'display_name': 'Discrete mathematics', 'level': 1, 'score': 0.5730138}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.5372991}, {'id': 'https://openalex.org/C176370821', 'wikidata': 'https://www.wikidata.org/wiki/Q1826459', 'display_name': 'Linear space', 'level': 2, 'score': 0.4868857}, {'id': 'https://openalex.org/C45374587', 'wikidata': 'https://www.wikidata.org/wiki/Q12525525', 'display_name': 'Computation', 'level': 2, 'score': 0.44438604}, {'id': 'https://openalex.org/C197685441', 'wikidata': 'https://www.wikidata.org/wiki/Q500716', 'display_name': 'PSPACE', 'level': 3, 'score': 0.44263038}, {'id': 'https://openalex.org/C2777027219', 'wikidata': 'https://www.wikidata.org/wiki/Q1284190', 'display_name': 'Constant (computer programming)', 'level': 2, 'score': 0.43749514}, {'id': 'https://openalex.org/C168773769', 'wikidata': 'https://www.wikidata.org/wiki/Q1350299', 'display_name': 'Satisfiability', 'level': 2, 'score': 0.4356546}, {'id': 'https://openalex.org/C63553672', 'wikidata': 'https://www.wikidata.org/wiki/Q581168', 'display_name': 'Binary logarithm', 'level': 2, 'score': 0.42029494}, {'id': 'https://openalex.org/C179799912', 'wikidata': 'https://www.wikidata.org/wiki/Q205084', 'display_name': 'Computational complexity theory', 'level': 2, 'score': 0.37336943}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.26459825}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.24128836}, {'id': 'https://openalex.org/C131671149', 'wikidata': 'https://www.wikidata.org/wiki/Q2703890', 'display_name': 'Universal Turing machine', 'level': 4, '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': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.1109/ccc.2000.856730', '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': 17, 'referenced_works': ['https://openalex.org/W1584670745', 'https://openalex.org/W1934698557', 'https://openalex.org/W1965844655', 'https://openalex.org/W1996834809', 'https://openalex.org/W2004471951', 'https://openalex.org/W2034441788', 'https://openalex.org/W2040654780', 'https://openalex.org/W2045717693', 'https://openalex.org/W2075363121', 'https://openalex.org/W2085938002', 'https://openalex.org/W2098411889', 'https://openalex.org/W2117427692', 'https://openalex.org/W2144345645', 'https://openalex.org/W2144557478', 'https://openalex.org/W2913527980', 'https://openalex.org/W4213009134', 'https://openalex.org/W4285719527'], 'related_works': ['https://openalex.org/W4388215614', 'https://openalex.org/W4286770094', 'https://openalex.org/W2949308819', 'https://openalex.org/W21360042', 'https://openalex.org/W2134140745', 'https://openalex.org/W2122747219', 'https://openalex.org/W2080505327', 'https://openalex.org/W2051933114', 'https://openalex.org/W1555195996', 'https://openalex.org/W1486286946'], 'abstract_inverted_index': {'We': [0, 84, 114, 164, 185], 'show': [1, 116, 165, 187], 'new': [2, 188], 'tradeoffs': [3, 117], 'for': [4, 41, 66, 79, 88, 95, 118], 'satisfiability': [5, 53, 97], 'and': [6, 24, 34, 37, 61, 110, 137, 150], 'nondeterministic': [7, 119, 134, 194], 'linear': [8, 120, 135], 'time.': [9], 'Satisfiability': [10], 'cannot': [11, 54, 98, 142], 'be': [12, 55, 99, 143], 'solved': [13, 56, 100], 'on': [14, 176, 191], 'general': [15], 'purpose': [16], 'random-access': [17, 103], 'Turing': [18, 104], 'machines': [19, 178], 'in': [20, 57, 133, 145], 'time': [21, 58, 109, 121, 136, 149, 175], 'n/sup': [22, 26, 59, 63, 107, 111, 138, 147, 151, 173, 182], '1.618/': [23, 148], 'space': [25, 62, 140], 'o(1)/.': [27], 'This': [28], 'improves': [29], 'recent': [30], 'results': [31], 'of': [32, 35], 'Fortnow': [33], 'Lipton': [36], 'Viglas.': [38], 'In': [39], 'general,': [40], 'any': [42], 'constant': [43, 69], 'a': [44, 89, 102, 130], 'less': [45], 'than': [46], 'the': [47, 92, 156], 'golden': [48, 93], 'ratio,': [49, 94], 'we': [50, 159], 'prove': [51], 'that': [52, 141, 166, 179], 'a/': [60], '/spl': [64, 168], 'delta//': [65], 'some': [67], 'positive': [68], 'b.': [70], 'Our': [71], 'techniques': [72], 'allow': [73], 'us': [74], 'to': [75, 91], 'establish': [76], 'this': [77], 'result': [78], 'b<': [80], '1/2': [81], '(/spl': [82], 'alpha/+2/a(2)-a).': [83], 'can': [85, 160], 'do': [86], 'better': [87, 162], 'close': [90], 'example,': [96, 127], 'by': [101], 'machine': [105], 'using': [106, 123], '1.46/': [108], '.11/': [112], 'space.': [113, 125, 153, 184], 'also': [115, 186], 'computations': [122], 'sublinear': [124], 'For': [126], 'there': [128], 'exists': [129], 'language': [131], 'computable': [132], '619/': [139], 'computed': [144], 'deterministic': [146, 177], 'o(1)/': [152, 183], 'Higher': [154], 'up': [155], 'polynomial-time': [157], 'hierarchy': [158], 'get': [161], 'bounds.': [163], 'linear-time': [167], 'Sigma//sub': [169], 'l/-computations': [170], 'require': [171], 'essentially': [172], 'l/': [174], 'use': [180], 'only': [181], 'lower': [189], 'bounds': [190], 'conondeterministic': [192], 'versus': [193], 'computation.': [195]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2101153990', 'counts_by_year': [{'year': 2019, 'cited_by_count': 1}, {'year': 2017, 'cited_by_count': 1}, {'year': 2016, 'cited_by_count': 1}, {'year': 2015, 'cited_by_count': 1}, {'year': 2013, 'cited_by_count': 3}, {'year': 2012, 'cited_by_count': 1}], 'updated_date': '2024-12-12T16:16:11.591389', 'created_date': '2016-06-24'}