Pages that link to "Item:Q1274992"
From MaRDI portal
The following pages link to Relating polynomial time to constant depth (Q1274992):
Displaying 6 items.
- The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis (Q2272200) (← links)
- A characterization of definability of second-order generalized quantifiers with applications to non-definability (Q2453584) (← links)
- Parity, circuits, and the polynomial-time hierarchy (Q3318683) (← links)
- Constant Depth Reducibility (Q3325043) (← links)
- Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy (Q3617079) (← links)
- Generic separations and leaf languages (Q4419264) (← links)