Complexity of Feasible Computations  (Computer Research)
{'Code': '05010001', 'Directorate': {'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'name not available'}
None
{'FirstName': 'Alan', 'LastName': 'Selman', 'EmailAddress': 'selman@buffalo.edu', 'StartDate': '07/01/1986', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'Northeastern University', 'CityName': 'BOSTON', 'ZipCode': '021155005', 'PhoneNumber': '6173733004', 'StreetAddress': '360 HUNTINGTON AVE', 'CountryName': 'United States', 'StateName': 'Massachusetts', 'StateCode': 'MA'}
{'Code': '2811', 'Text': 'THEORETICAL COMPUTER SCIENCE'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1986&All=true', 'xml': '8696082.xml'}