Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower ..."

Alexander E. Andreev et al. (1999)

> Home

Details and statistics

DOI: 10.1007/3-540-48523-6_15

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icalp/AndreevBCR99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/AndreevBCR99
Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim:
Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs. ICALP 1999: 179-189

a service of

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.