eCommons

 

On Computing Boolean Connectives of Characteristic Functions

Other Titles

Abstract

We study the existence of polynomial time Boolean connective functions for languages. A language L has an AND function if there is a polynomial time f such that f(x,y)∈LxL and yL. L has an OR function if there is a polynomial time g such that g(x,y)∈LxL or yL. While all NP-complete sets have these functions, we show that Graph Isomorphism, which is probably not complete, also has them. We characterize the complete sets for the classes DP and PNP[O(logn)] in terms of AND and OR, and we relate these functions to the structure of the Boolean hierarchy and the query hierarchies. We show that the sets that are complete for levels above the second level of the Boolean hierarchy do not have AND and OR unless the polynomial hierarchy collapses. We show that most of the structural properties of the Boolean hierarchy and query hierarchies depend only on the existence of AND and OR functions for NP-complete sets.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1990-05

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR90-1118

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record