Lower Bound Arguments in Machine Based Complexity Theory
{'Code': '05010100', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'name not available', 'PO_EMAI': None, 'PO_PHON': None}
Mathematical arguments are being developed for proving lower bounds on          the computation time and on other resources in machine based complexity         theory.  Combinatorial methods are being explored for answering a number        of fundamental questions about important methods for both sequential and        parallel computers.  Among the mdoels considered are Turing machines,           random access machines, branching programs, and circuits.                                                                                                       Lower bound results are important in the science of computing for at            least two major reasons:  (1) they allow evaluation and comparison of           various computational models that reflect interesting aspects of                currently existing computers and of potential future computers; and (2)         they allow comparisons of the use of computational resources by                 currently known algorithms with theoretically established optimal               limits.  Thus lower bound results may indicate where room for                   improvement lies in both computational models and in existing                   algorithms.
{'FirstName': 'Wolfgang', 'LastName': 'Maass', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Wolfgang Maass', 'EmailAddress': None, 'NSF_ID': '000468643', 'StartDate': '07/15/1987', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'University of Illinois at Chicago', 'CityName': 'CHICAGO', 'ZipCode': '606124305', 'PhoneNumber': '3129962862', 'StreetAddress': '809 S MARSHFIELD AVE M/C 551', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Illinois', 'StateCode': 'IL', 'CONGRESSDISTRICT': '07', 'CONGRESS_DISTRICT_ORG': 'IL07', 'ORG_UEI_NUM': 'W8XEAJDKMXH3', 'ORG_LGL_BUS_NAME': 'UNIVERSITY OF ILLINOIS', 'ORG_PRNT_UEI_NUM': None}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
{'Code': '286000', 'Text': 'THEORY OF COMPUTING'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1987&All=true', 'xml': '8703889.xml'}