N
Neil Immerman
Researcher at University of Massachusetts Amherst
Publications - 139
Citations - 11329
Neil Immerman is an academic researcher from University of Massachusetts Amherst. The author has contributed to research in topics: Descriptive complexity theory & Complexity class. The author has an hindex of 46, co-authored 137 publications receiving 10704 citations. Previous affiliations of Neil Immerman include Massachusetts Institute of Technology & Pennsylvania State University.
Papers
More filters
Proceedings Article
The complexity of decentralized control of Markov decision processes
TL;DR: In this paper, the authors considered the problem of planning for distributed agents with partial state information from a decision-theoretic perspective, and provided mathematical evidence corresponding to the intuition that decentralized planning problems cannot easily be reduced to centralized problems and solved exactly using established techniques.
Journal ArticleDOI
The Complexity of Decentralized Control of Markov Decision Processes
TL;DR: This work considers decentralized control of Markov decision processes and gives complexity bounds on the worst-case running time for algorithms that find optimal solutions and describes generalizations that allow for decentralized control.
Journal ArticleDOI
Nondeterministic space is closed under complementation
TL;DR: It immediately follows that the context-sensitive languages are closed under complementation, thus settling a question raised by Kuroda.
Journal ArticleDOI
Relational queries computable in polynomial time
TL;DR: The rotary ball valve includes a generally annular seal which is held in place by an edge anchored annular retainer which is oversized for the valve housing and on installation resides in a state of compression.
Journal ArticleDOI
Languages that capture complexity classes
TL;DR: It is shown that projection translations are a uniform version of Valiant’s projections, and that the usual complete problems remain complete via these very restrictive reductions.