"Hard submatrices for non-negative rank and communication complexity."

Pavel Hrubes (2025)

> Home

Details and statistics

DOI: 10.1007/S00037-025-00269-4

access: closed

type: Journal Article

metadata version: 2025-09-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cc/Hrubes25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cc/Hrubes25
Pavel Hrubes:
Hard submatrices for non-negative rank and communication complexity. Comput. Complex. 34(2): 9 (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.