"Query complexity of Boolean functions on slices."

Farzan Byramji (2024)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2024.113954

access: closed

type: Journal Article

metadata version: 2024-05-31

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dm/Byramji24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Byramji24
Farzan Byramji:
Query complexity of Boolean functions on slices. Discret. Math. 347(6): 113954 (2024)

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.