Work

Parity, circuits, and the polynomial-time hierarchy

Year: 1984

Type: article

Source: Theory of Computing Systems

DOI: 10.1007/bf01744431

Authors: Merrick Furst, James B. Saxe, Michael Sipser

Institutions: Carnegie Mellon University, Massachusetts Institute of Technology

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2060270693

FWCI: 12.31

Cites: 16

Cited by: 988

Related to: 10