The Structure of Complete Sets And Honest Polynomial Reducibilities
{'Code': '05010100', 'Directorate': {'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'Dana S. Richards'}
This project is aimed at an improved understanding of properties and structure of complete sets for several, extensively studied complexity classes. In particular, complete sets under strong polynomial reductions and the existence of p-isomorphisms between these sets are to be studied. In addition, a study will be made of honest polynomial reducibilities and minimal sets for these reducibilities. The goal is to relate the structure of polynomial reducibilities and open problems in complexity theory to methods and results of recursion theory. The relationship between the existence of minimal sets with respect to honest polynomial reductions and the P=? NP problem will be studied.
{'FirstName': 'Steven', 'LastName': 'Homer', 'EmailAddress': 'homer@bu.edu', 'StartDate': '06/01/1989', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'Trustees of Boston University', 'CityName': 'BOSTON', 'ZipCode': '022151300', 'PhoneNumber': '6173534365', 'StreetAddress': '881 COMMONWEALTH AVE', 'CountryName': 'United States', 'StateName': 'Massachusetts', 'StateCode': 'MA'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1988&All=true', 'xml': '8814339.xml'}