scientific article; zbMATH DE number 1302020
From MaRDI portal
Publication:4247261
zbMATH Open0945.03546MaRDI QIDQ4247261FDOQ4247261
Authors: Neil Immerman 
Publication date: 7 December 1999
Title of this publication is not available (Why is that?)
Model theory of finite structures (03C13) Specification and verification (program logics, model checking, etc.) (68Q60) Descriptive complexity and finite models (68Q19) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (24)
- Knowledge representation analysis of graph mining
- Capturing the polynomial hierarchy by second-order revised Krom logic
- \(\mathrm P \overset {?} {=} \mathrm{NP}\)
- Characterizing polynomial Ramsey quantifiers
- An infinite hierarchy of temporal logics over branching time
- Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits
- An extension of the Ehrenfeucht-Fraïssé game for first order logics augmented with Lindström quantifiers
- Number of variables is equivalent to space
- Epsilon-logic is more expressive than first-order logic over finite structures
- COMPLEXITY, INFORMATION, ENERGY
- 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02
- A logical characterization of small 2NFAs
- On the space and circuit complexity of parameterized problems: classes and completeness
- Parameterized Complexity Classes under Logical Reductions
- Annotation theories over finite graphs
- Descriptive complexity of finite abelian groups
- Formal descriptions of code properties: decidability, complexity, implementation
- Voting by eliminating quantifiers
- \(\mathrm{SO}^F\): a semantic restriction over second-order logic and its polynomial-time hierarchy
- Book review of: E. Grädel, P. Kolaitis, L. Libkin, M. Marx, I. Spencer, M. Vardi, Y. Venema, S. Weinstein, Finite model theory and its applications
- The probability nesting game
- Generic incremental algorithms for local search
- Approximate databases: a support tool for approximate reasoning
- Hardness of equivalence checking for composed finite-state systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247261)
