The following pages link to Paulin Jacobé de Naurois (Q534702):
Displayed 12 items.
- Correctness of linear logic proof structures is NL-complete (Q534703) (← links)
- Parallel time and quantifier prefixes (Q626666) (← links)
- The complexity of semilinear problems in succinct representation (Q862341) (← links)
- Implicit complexity over an arbitrary structure: Quantifier alternations (Q2490113) (← links)
- Rewriting Systems for Reachability in Vector Addition Systems with Pairs (Q3584966) (← links)
- Correctness of Multiplicative (and Exponential) Proof Structures is NL-Complete (Q3608429) (← links)
- (Q4417859) (← links)
- Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time (Q4673356) (← links)
- (Q4673422) (← links)
- Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH (Q4916232) (← links)
- Fundamentals of Computation Theory (Q5492953) (← links)
- Logical Approaches to Computational Barriers (Q5898821) (← links)