DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Neil Immerman
Neil Immerman
Computational Complexity Computational Complexity
The Communication Complexity of Interleaved Group Products
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
The Book Review Column1 by William Gasarch Department of Computer Science University of Maryland at College Park College Park, MD, 20742 Email:
[email protected]
1. Introduction
Chicago Journal of Theoretical Computer Science the MIT Press
Download This PDF File
On the Unusual Effectiveness of Logic in Computer Science
Some Estimated Likelihoods for Computational Complexity
ERIC W. ALLENDER Department of Computer Science
A First-Order Isomorphism Theorem
Towards an Algebraic Natural Proofs Barrier Via Polynomial Identity Testing
Mathematical Logic in Computer Science
Sponsored by IEEE Computer Society Technical Committee On
Many Facets of Complexity in Logic
Pseudo-Deterministic Proofs
Contents U U U
Randomisation and Derandomisation in Descriptive Complexity Theory
Top View
On the Complexity of the St-Connectivity Problem
Descriptive Complexity
Bibliography
Dynamic Complexity of Expansion
What Is Theoretical Computer Science? (Preliminary Version)
Progress in Computational Complexity Theory
Realizable Paths and the NL Vs L Problem
STOC ’95 to Qualify for the Early Registration Fee, Your Registration Application Must Be Postmarked by Monday, May 1, 1995
Subspace-Invariant Ac0 Formulas
Satisfiability Coding Lemma
Directed Planar Reachability Is in Unambiguous Log-Space
Streaming Algorithms Via Reductions