"Slicing all Edges of an n-cube Requires n^2/3 Hyperplanes."

Ohad Klein (2023)

> Home

Details and statistics

DOI: 10.1109/FOCS57990.2023.00117

access: closed

type: Conference or Workshop Paper

metadata version: 2024-01-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/focs/Klein23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/Klein23
Ohad Klein:
Slicing all Edges of an n-cube Requires n^2/3 Hyperplanes. FOCS 2023: 1931-1936

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.