The following pages link to Pierre McKenzie (Q208763):
Displayed 20 items.
- (Q4536377) (← links)
- Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete (Q4635789) (← links)
- Affine Parikh automata (Q4649455) (← links)
- Arithmetic Circuits and Polynomial Replacement Systems (Q4651522) (← links)
- (Q4732127) (← links)
- Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method (Q4973868) (← links)
- The Reachability Problem for Two-Dimensional Vector Addition Systems with States (Q5056423) (← links)
- Testing membership: Beyond permutation groups (Q5096172) (← links)
- (Q5101347) (← links)
- Does Looking Inside a Circuit Help (Q5111215) (← links)
- The Power of Programs over Monoids in DA (Q5111216) (← links)
- Better complexity bounds for cost register automata (Q5111238) (← links)
- Handling Infinitely Branching WSTS (Q5167823) (← links)
- (Q5367063) (← links)
- On Generalized Addition Chains (Q5408182) (← links)
- (Q5414621) (← links)
- UNAMBIGUOUS CONSTRAINED AUTOMATA (Q5495422) (← links)
- The descriptive complexity approach to LOGCFL (Q5946058) (← links)
- On the complexity of some problems on groups input as multiplication tables (Q5956010) (← links)
- Perspective on complexity measures targetting read-once branching programs (Q6437151) (← links)