Pages that link to "Item:Q626676"
From MaRDI portal
The following pages link to \(k\)-subgraph isomorphism on \(\text{AC}^{0}\) circuits (Q626676):
Displaying 9 items.
- Beating treewidth for average-case subgraph isomorphism (Q2041983) (← links)
- Certifying polynomials for \(\mathsf{AC}^0[\oplus]\) circuits, with applications to lower bounds and circuit compression (Q4612476) (← links)
- (Q4638077) (← links)
- A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem (Q4957916) (← links)
- A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas (Q5002707) (← links)
- On the $AC^0$ Complexity of Subgraph Isomorphism (Q5737815) (← links)
- Tree-Depth and the Formula Complexity of Subgraph Isomorphism (Q5885602) (← links)
- Parameterized Complexity of DPLL Search Procedures (Q5892559) (← links)
- The descriptive complexity of subgraph isomorphism without numerics (Q5919541) (← links)
