The following pages link to Etienne Grandjean (Q295629):
Displaying 32 items.
- A logical approach to locality in pictures languages (Q295631) (← links)
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- First-order spectra with one variable (Q909462) (← links)
- (Q1266165) (redirect page) (← links)
- Monadic logical definability of nondeterministic linear time (Q1266167) (← links)
- Invariance properties of RAMs and linear time (Q1327595) (← links)
- Sorting, linear time and the satisfiability problem (Q1817067) (← links)
- (Q3030809) (← links)
- The Spectra of First-Order Sentences and Computational Complexity (Q3318756) (← links)
- Complexity of the first-order theory of almost all finite structures (Q3329449) (← links)
- (Q3340841) (← links)
- A Nontrivial Lower Bound for an NP Problem on Automata (Q3477958) (← links)
- Computing the<i>j</i>th solution of a first-order query (Q3514640) (← links)
- On Acyclic Conjunctive Queries and Constant Delay Enumeration (Q3608414) (← links)
- Universal quantifiers and time complexity of random access machines (Q3699679) (← links)
- A Natural NP-Complete Problem with a Nontrivial Lower Bound (Q3796747) (← links)
- (Q4090317) (← links)
- (Q4108315) (← links)
- (Q4281688) (← links)
- (Q4283241) (← links)
- Linear Time Algorithms and NP-Complete Problems (Q4302285) (← links)
- SAT-Problems and Reductions with Respect to the Number of Variables (Q4351797) (← links)
- (Q4411837) (← links)
- (Q4474839) (← links)
- (Q4649552) (← links)
- Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time (Q4785637) (← links)
- Definability by Horn formulas and linear time on cellular automata (Q5111431) (← links)
- First-order queries on structures of bounded degree are computable with constant delay (Q5277786) (← links)
- STACS 2004 (Q5309712) (← links)
- Inductive definitions in logic versus programs of real-time cellular automata (Q6122593) (← links)
- Conjunctive grammars, cellular automata and logic (Q6587268) (← links)
- Descriptive complexity for minimal time of cellular automata (Q6654477) (← links)
