"Lower Bounding the AND-OR Tree via Symmetrization."

William Kretschmer (2021)

> Home

Details and statistics

DOI: 10.1145/3434385

access: closed

type: Journal Article

metadata version: 2021-04-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/toct/Kretschmer21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toct/Kretschmer21
William Kretschmer:
Lower Bounding the AND-OR Tree via Symmetrization. ACM Trans. Comput. Theory 13(1): 3:1-3:11 (2021)

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.