When worlds collide: Derandomization, lower bounds, and Kolmogorov complexity

Conference proceeding

Peer reviewed

Lecture notes in computer science, Vol.2245, pp.1-15

FST TCS 2001 : foundations of software technology and theoretical computer science (Bangalore, 13-15 december 2001)

2001

Abstract

Applied sciences

Theoretical computing

Automata. Abstract machines. Turing machines

Exact sciences and technology

Computer science; control theory; systems

7 Record Views

Title: When worlds collide: Derandomization, lower bounds, and Kolmogorov complexity
Creators: Eric ALLENDER - Department of Computer Science, Rutgers University, Piscataway, NJ 08854-8019, United States
Publication Details: Lecture notes in computer science, Vol.2245, pp.1-15
Conference: FST TCS 2001 : foundations of software technology and theoretical computer science (Bangalore, 13-15 december 2001)
Date published: 2001
Publisher: Springer
Academic Unit: Computer Science (SAS)
Language: English
Resource Type: Conference proceeding
Identifiers: 991031654453404646