The following pages link to Natural proofs (Q5890841):
Displaying 10 items.
- Binary pattern tile set synthesis is NP-hard (Q527409) (← links)
- Optimal bounds for the approximation of Boolean functions and some applications (Q1390872) (← links)
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- On the limits of gate elimination (Q1635510) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- The correlation between parity and quadratic polynomials mod \(3\) (Q1881261) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- Barriers for Rank Methods in Arithmetic Complexity (Q4993264) (← links)
- (Q5002692) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
