"Parity Graph-driven Read-Once Branching Programs and an Exponential Lower ..."

Beate Bollig, Stephan Waack, Philipp Woelfel (2002)

> Home

Details and statistics

DOI: 10.1007/978-0-387-35608-2_8

access: closed

type: Conference or Workshop Paper

metadata version: 2019-09-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ifipTCS/BolligWW02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ifipTCS/BolligWW02
Beate Bollig, Stephan Waack, Philipp Woelfel:
Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. IFIP TCS 2002: 83-94

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.