Pages that link to "Item:Q853647"
From MaRDI portal
The following pages link to On the computational power of Boolean decision lists (Q853647):
Displaying 12 items.
- A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length (Q368235) (← links)
- Hardness Amplification and the Approximate Degree of Constant-Depth Circuits (Q3448791) (← links)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
- (Q4988300) (← links)
- (Q5009530) (← links)
- Decision List Compression by Mild Random Restrictions (Q5056434) (← links)
- No Efficient Disjunction or Conjunction of Switch-Lists (Q5080958) (← links)
- A Short List of Equalities Induces Large Sign-Rank (Q5087014) (← links)
- A Lifting Theorem with Applications to Symmetric Functions (Q5136315) (← links)
- (Q5158501) (← links)
- Hardness Characterisations and Size-width Lower Bounds for QBF Resolution (Q5886517) (← links)
- Decision lists and related Boolean functions (Q5958318) (← links)