Pages that link to "Item:Q4601826"
From MaRDI portal
The following pages link to 30th Conference on Computational Complexity (CCC 2015) (Q4601826):
Displaying 6 items.
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Multiparty communication complexity and threshold circuit size of AC\(^0\) (Q2910850) (← links)
- Certifying polynomials for \(\mathsf{AC}^0[\oplus]\) circuits, with applications to lower bounds and circuit compression (Q4612476) (← links)
- On polynomial approximations to AC (Q4633319) (← links)
- Depth Reduction for Composites (Q4634033) (← links)
- Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates (Q4636650) (← links)