scientific article; zbMATH DE number 1827092
From MaRDI portal
Publication:4781230
zbMath0998.68067MaRDI QIDQ4781230
Niels Schmitt, Hans Ulrich Simon, Jürgen Forster
Publication date: 25 November 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
A linear lower bound on the unbounded error probabilistic communication complexity. ⋮ Complexity measures of sign matrices ⋮ Lipschitz representations of subsets of the cube ⋮ On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes
This page was built for publication:
