Pages that link to "Item:Q3084685"
From MaRDI portal
The following pages link to ON THE HARDNESS AGAINST CONSTANT-DEPTH LINEAR-SIZE CIRCUITS (Q3084685):
Displaying 5 items.
- On derandomization and average-case complexity of monotone functions (Q428873) (← links)
- Lower bounds for constant-depth circuits in the presence of help bits (Q917289) (← links)
- Linear-size constant-depth polylog-threshold circuits (Q1182085) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- Computing and Combinatorics (Q5717021) (← links)