The Complexity of Decentralized Control of Markov Decision Processes
- D. Bernstein, S. Zilberstein, N. Immerman
- Mathematics, Computer ScienceConference on Uncertainty in Artificial…
- 30 June 2000
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.
An optimal lower bound on the number of variables for graph identification
- Jin-Yi Cai, Martin Fürer, N. Immerman
- Mathematics30th Annual Symposium on Foundations of Computer…
- 30 October 1989
It is shown that Omega (n) variables are needed for first-order logic with counting to identify graphs on n vertices and the lower bound is optimal up to multiplication by a constant.
Efficient pattern matching over event streams
- Jagrati Agrawal, Y. Diao, Daniel Gyllstrom, N. Immerman
- Computer ScienceSIGMOD Conference
- 9 June 2008
This paper presents a formal evaluation model that offers precise semantics for this new class of queries and a query evaluation framework permitting optimizations in a principled way and further analyzes the runtime complexity of query evaluation using this model and develops a suite of techniques that improve runtime efficiency by exploiting sharing in storage and processing.
Relational Queries Computable in Polynomial Time
- N. Immerman
- GeologyInformation and Control
- 1 March 1986
Descriptive Complexity
- N. Immerman
- Computer ScienceGraduate Texts in Computer Science
- 1999
The core of the book is contained in Chapters 1 through 7, although even here some sections can be omitted according to the taste and interests of the instructor, and the remaining chapters are more independent of each other.
Languages that Capture Complexity Classes
- N. Immerman
- Computer Science, MathematicsSIAM journal on computing (Print)
- 1 August 1987
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.
On Uniformity within NC¹
- D. M. Barrington, N. Immerman, Howard Straubing
- Computer ScienceJournal of computer and system sciences (Print)
- 1 December 1990
Nondeterministic space is closed under complementation
- N. Immerman
- Mathematics[] Proceedings. Structure in Complexity Theory…
- 14 June 1988
It immediately follows that the context-sensitive languages are closed under complementation, thus settling a question raised by Kuroda.
Upper and lower bounds for first order expressibility
- N. Immerman
- Mathematics21st Annual Symposium on Foundations of Computer…
- 13 October 1980
On complexity and optimization of expensive queries in complex event processing
- Haopeng Zhang, Y. Diao, N. Immerman
- Computer ScienceSIGMOD Conference
- 18 June 2014
This study begins by analyzing the complexity of pattern queries, with a focus on the fundamental understanding of which features make pattern queries more expressive and at the same time more computationally expensive, and provides key insights for a series of optimizations to mitigate those bottlenecks.
...
...