Pages that link to "Item:Q917289"
From MaRDI portal
The following pages link to Lower bounds for constant-depth circuits in the presence of help bits (Q917289):
Displaying 5 items.
- An oracle separating \(\oplus P\) from \(PP^{PH}\) (Q751272) (← links)
- Arity bounds in first-order incremental evaluation and definition of polynomial time database queries (Q1278038) (← links)
- Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
- The value of help bits in randomized and average-case complexity (Q2012180) (← links)
- SEPARATING AUXILIARY ARITY HIERARCHY OF FIRST-ORDER INCREMENTAL EVALUATION SYSTEMS USING (3K+1)-<font>ary</font> INPUT RELATIONS (Q4528763) (← links)