Work

Parity, circuits, and the polynomial-time hierarchy

Year: 1981

Type: conference-paper

Source: Annual Symposium on Foundations of Computer Science

DOI: 10.1109/sfcs.1981.35

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: W2014850486

FWCI: 10.18

Cites: 13

Cited by: 235

Related to: 10