The following pages link to Neil Immerman (Q6482617):
Displaying 1 item.
- (Q359971) (redirect page) (← links)
- Applicability conditions for plans with loops: computability results and algorithms (Q359973) (← links)
- A new representation and associated algorithms for generalized planning (Q543617) (← links)
- The expressiveness of a family of finite set languages (Q672126) (← links)
- Definability with bounded number of bound variables (Q922523) (← links)
- The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812) (← links)
- Interpreting logics of knowledge in propositional dynamic logic (Q1096609) (← links)
- Number of quantifiers is better than number of tape cells (Q1164622) (← links)
- Upper and lower bounds for first order expressibility (Q1173404) (← links)
- An optimal lower bound on the number of variables for graph identification (Q1204528) (← links)
- The complexity of iterated multiplication (Q1346717) (← links)
- Embedding linkages on an integer lattice (Q1348941) (← links)
- Reachability and the power of local ordering (Q1367543) (← links)
- Dyn-FO: A parallel, dynamic complexity class (Q1376403) (← links)
- First-order expressibility of languages with neutral letters or: The Crane Beach conjecture (Q1776372) (← links)
- Relativizing relativized computations (Q1822968) (← links)
- Tree canonization and transitive closure (Q1854332) (← links)
- On uniformity within \(NC^ 1\) (Q2640342) (← links)
- On the Unusual Effectiveness of Logic in Computer Science (Q2736585) (← links)
- Number of variables is equivalent to space (Q2758055) (← links)
- (Q2769034) (← links)
- Decentralizing SDN Policies (Q2819856) (← links)
- Decidability of inferring inductive invariants (Q2828258) (← links)
- Solving Geometry Problems Using a Combination of Symbolic and Numerical Reasoning (Q2870147) (← links)
- Experimental Descriptive Complexity (Q2897942) (← links)
- Bounded Quantifier Instantiation for Checking Inductive Invariants (Q3303891) (← links)
- Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words (Q3395099) (← links)
- Finding Reductions Automatically (Q3586003) (← links)
- Structure Theorem and Strict Alternation Hierarchy for FO2 on Words (Q3608423) (← links)
- First-Order and Temporal Logics for Nested Words (Q3623007) (← links)
- Simulating reachability using first-order logic with applications to verification of linked data structures (Q3636811) (← links)
- (Q3696516) (← links)
- Sparse sets in NP-P: EXPTIME versus NEXPTIME (Q3711749) (← links)
- Relational queries computable in polynomial time (Q3753525) (← links)
- Languages that Capture Complexity Classes (Q3773337) (← links)
- Nondeterministic Space is Closed under Complementation (Q3821586) (← links)
- (Q3830533) (← links)
- (Q3974868) (← links)
- Expressibility and Parallel Complexity (Q4207580) (← links)
- (Q4227581) (← links)
- (Q4247261) (← links)
- (Q4267172) (← links)
- (Q4281518) (← links)
- A First-Order Isomorphism Theorem (Q4337654) (← links)
- (Q4359454) (← links)
- Reachability logic: an efficient fragment of transitive closure logic (Q4487265) (← links)
- (Q4790381) (← links)
- (Q4942645) (← links)
- (Q5232900) (← links)
- An <i>n</i> ! lower bound on formula size (Q5267432) (← links)
- Computer Science Logic (Q5311254) (← links)
- Computer Aided Verification (Q5312907) (← links)
- Modular reasoning about heap paths via effectively propositional formulas (Q5408433) (← links)
- Constructing Specialized Shape Analyses for Uniform Change (Q5452609) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492848) (← links)
- The Complexity of Decentralized Control of Markov Decision Processes (Q5704111) (← links)
