"Query complexity of Boolean functions on the middle slice of the cube."

Dániel Gerbner et al. (2025)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2024.11.018

access: closed

type: Journal Article

metadata version: 2025-02-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/GerbnerKNNPPW25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/GerbnerKNNPPW25
Dániel Gerbner, Balázs Keszegh, Dániel T. Nagy, Kartal Nagy, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener:
Query complexity of Boolean functions on the middle slice of the cube. Discret. Appl. Math. 362: 43-49 (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.