scientific article; zbMATH DE number 176870
From MaRDI portal
Publication:4036701
Cited in
(22)- On the limits of gate elimination
- scientific article; zbMATH DE number 524142 (Why is no real title available?)
- On the limits of gate elimination
- scientific article; zbMATH DE number 4049557 (Why is no real title available?)
- scientific article; zbMATH DE number 4170847 (Why is no real title available?)
- Barriers for rank methods in arithmetic complexity
- Local bounds for the optimal information ratio of secret sharing schemes
- scientific article; zbMATH DE number 981681 (Why is no real title available?)
- On the nonnegative rank of distance matrices
- On \(k\)-submodular relaxation
- On \(\epsilon\)-sensitive monotone computations
- Prediction from partial information and hindsight, with application to circuit lower bounds
- On the complexity of submodular function minimisation on diamonds
- scientific article; zbMATH DE number 66469 (Why is no real title available?)
- Natural proofs
- Applications of matrix methods to the theory of lower bounds in computational complexity
- Computability of width of submodular partition functions
- Submodular containment is hard, even for networks
- Subrank and optimal reduction of scalar multiplications to generic tensors
- On convex complexity measures
- Submodular goal value of Boolean functions
- A note on matrix rigidity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036701)
