RUI: Algebraic Algorithms Computational Complexity
{'Code': '05010100', 'Directorate': {'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'Bruce H. Barnes'}
The researcher intends to continue work in the area of algebraic algorithms and computational complexity. Specifically she will continue work on algebraic simplification. She plans to study the relationship between polynomials and integers: In what sense do algorithms translate from one domain to the other? Lower bounds? She will also begin work on the complexity of iterated multiplication.
{'FirstName': 'Susan', 'LastName': 'Landau', 'EmailAddress': 'landau@cs.umass.edu', 'StartDate': '07/15/1988', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'Wesleyan University', 'CityName': 'Middletown', 'ZipCode': '064593208', 'PhoneNumber': '8606853683', 'StreetAddress': '237 HIGH ST', 'CountryName': 'United States', 'StateName': 'Connecticut', 'StateCode': 'CT'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1988&All=true', 'xml': '8802835.xml'}