The enumerability of P collapses P to NC

Conference proceeding

Peer reviewed

Alina Beygelzimer and Mitsunori Ogihara

Lecture notes in computer science, Vol.3153, pp.346-355

MFCS 2004 : mathematical foundations of computer science (Prague, 22-27 August 2004)

2004

Abstract

Algorithmics. Computability. Computer arithmetics

Applied sciences

Computer science; control theory; systems

Exact sciences and technology

Theoretical computing

7 Record Views

Title: The enumerability of P collapses P to NC
Creators: Alina Beygelzimer - IBM T.J. Watson Research Center, Hawthorne, NY 10532, United States
Mitsunori Ogihara - Department of Computer Science, University of Rochester, Rochester, NY 14627, United States
Publication Details: Lecture notes in computer science, Vol.3153, pp.346-355
Conference: MFCS 2004 : mathematical foundations of computer science (Prague, 22-27 August 2004)
Publisher: Springer
Academic Unit: College of A&S; A&S - Computer Science
Language: English
Resource Type: Conference proceeding
Record Identifier: 991031619913802976