scientific article
From MaRDI portal
Publication:2808527
DOI10.4086/cjtcs.2016.002zbMath1356.68085arXiv1603.07779OpenAlexW2303197778MaRDI QIDQ2808527
No author found.
Publication date: 24 May 2016
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.07779
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Boolean and Hadamard matrices (15B34)
Related Items (6)
The augmentation property of binary matrices for the binary and Boolean rank ⋮ Communication complexity with small advantage ⋮ Alternating sign matrices, related (0,1)-matrices, and the Smith normal form ⋮ The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions ⋮ Unnamed Item ⋮ Rectangles Are Nonnegative Juntas
Cites Work
- Expressing combinatorial optimization problems by linear programs
- Communication complexity and combinatorial lattice theory
- On rank vs. communication complexity
- An upper bound for nonnegative rank
- Ordered biclique partitions and communication complexity problems
- Communication is Bounded by Root of Rank
- The Pattern Matrix Method
This page was built for publication:
