Pages that link to "Item:Q2904750"
From MaRDI portal
The following pages link to Algorithmic meta theorems for circuit classes of constant and logarithmic depth (Q2904750):
Displaying 16 items.
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Balancing bounded treewidth circuits (Q1678757) (← links)
- Knapsack in graph groups (Q1702854) (← links)
- A gentle introduction to applications of algorithmic metatheorems for space and circuit classes (Q1736808) (← links)
- A logical characterization of constant-depth circuits over the reals (Q2148775) (← links)
- Closure properties of knapsack semilinear groups (Q2236107) (← links)
- Complexity of regular functions (Q2424670) (← links)
- Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups (Q2975251) (← links)
- Algorithmic Meta-theorems (Q3503574) (← links)
- (Q4553282) (← links)
- Parallel complexity for nilpotent groups (Q5084295) (← links)
- TC^0 circuits for algorithmic problems in nilpotent groups (Q5111237) (← links)
- (Q5111875) (← links)
- Where First-Order and Monadic Second-Order Logic Coincide (Q5278195) (← links)
- Knapsack in hyperbolic groups (Q5919299) (← links)
- The complexity of bidirected reachability in valence systems (Q6649456) (← links)
