Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"On Lower Bounds for Read-K-Times Branching Programs."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

Allan Borodin, Alexander A. Razborov, Roman Smolensky (1993)

> Home

Details and statistics

DOI: 10.1007/BF01200404

access: closed

type: Journal Article

metadata version: 2020-03-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cc/BorodinRS93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cc/BorodinRS93
Allan Borodin, Alexander A. Razborov, Roman Smolensky:
On Lower Bounds for Read-K-Times Branching Programs. Comput. Complex. 3: 1-18 (1993)

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.