scientific article; zbMATH DE number 176870
From MaRDI portal
Publication:4036701
zbMATH Open0770.68073MaRDI QIDQ4036701FDOQ4036701
Authors: Alexander Razborov 
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
Recommendations
Cited In (23)
- Title not available (Why is that?)
- Complete submodularity characterization in the comparative independent cascade model
- Submodular containment is hard, even for networks
- Subrank and optimal reduction of scalar multiplications to generic tensors
- Title not available (Why is that?)
- On the nonnegative rank of distance matrices
- On the limits of gate elimination
- On the limits of gate elimination
- A note on matrix rigidity
- On convex complexity measures
- Prediction from partial information and hindsight, with application to circuit lower bounds
- Title not available (Why is that?)
- Natural proofs
- On \(k\)-submodular relaxation
- Computability of width of submodular partition functions
- Barriers for rank methods in arithmetic complexity
- Applications of matrix methods to the theory of lower bounds in computational complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Submodular goal value of Boolean functions
- On \(\epsilon\)-sensitive monotone computations
- On the complexity of submodular function minimisation on diamonds
- Local bounds for the optimal information ratio of secret sharing schemes
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)
