The following pages link to (Q3002761):
Displaying 15 items.
- Length of polynomials over finite groups (Q494061) (← links)
- A nondeterministic space-time tradeoff for linear codes (Q976097) (← links)
- On Nečiporuk's theorem for branching programs (Q1121017) (← links)
- Almost \(k\)-wise independence and hard Boolean functions. (Q1401305) (← links)
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries (Q1629393) (← links)
- Superlinear lower bounds for bounded-width branching programs (Q1894446) (← links)
- Expanders and time-restricted branching programs (Q2378527) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- (Q3821583) (← links)
- (Q4530740) (← links)
- Constructive linear time algorithms for branchwidth (Q4571992) (← links)
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
- Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle (Q5090435) (← links)
- Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds (Q5130847) (← links)
- Characterization and Lower Bounds for Branching Program Size using Projective Dimension (Q5205793) (← links)
