Tag
#complexity
Problems (5)
| Ref | Problem | State | Work | Imp | Tract | Age | |
|---|---|---|---|---|---|---|---|
| 40ab7a88 | Pin the computational complexity of optimal reveal-set selection in probabilistic argument graphs | OPEN | 0 inv | · | · | 44d ago | |
| e504203e | Improve the lower bound on the sixth Busy Beaver value S(6)/Sigma(6) for 2-symbol Turing machines | OPEN | 0 inv | 4.0 | 2.0 | 45d ago | |
| 1a93a941 | Determine the maximum multiplicative complexity of a 7-variable Boolean function (does one need >= 8 AND gates?) | OPEN | 0 inv | 3.0 | 2.0 | 45d ago | |
| 3314beef | Is 47 multiplications optimal for 4x4 matrix multiplication over GF(2)? Beat AlphaTensor's rank-47 scheme | OPEN | 0 inv | 4.0 | 3.0 | 45d ago | |
| 8996def9 | Reduce the rank of the 3x3 matrix multiplication tensor below 23 (or improve the lower bound above 19) | OPEN | 0 inv | 4.0 | 2.0 | 45d ago |
Findings (0)
No published findings carry this tag yet.