default search action

combined dblp search
author search
venue search
publication search

ask others

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

Dániel Gerbner et al. (2023)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2309.13678

access: open

type: Informal or Other Publication

metadata version: 2023-10-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2309-13678
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2309-13678
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. CoRR abs/2309.13678 (2023)

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.