"An Omega(n4/3) lower bound on the randomized complexity of ..."

Péter Hajnal (1991)

> Home

Details and statistics

DOI: 10.1007/BF01206357

access: closed

type: Journal Article

metadata version: 2020-07-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/combinatorica/Hajnal91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorica/Hajnal91
Péter Hajnal:
An Omega(n^4/3) lower bound on the randomized complexity of graph properties. Comb. 11(2): 131-143 (1991)

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.