Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"On Oblivious Branching Programs with Bounded Repetition that Cannot ..."

Igor Razgon (2017)

> Home

Details and statistics

DOI: 10.1007/S00224-016-9714-0

access: closed

type: Journal Article

metadata version: 2017-08-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/Razgon17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/Razgon17
Igor Razgon:
On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth. Theory Comput. Syst. 61(3): 755-776 (2017)

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.