"Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once ..."

Michael A. Forbes, Amir Shpilka (2013)

> Home

Details and statistics

DOI: 10.1109/FOCS.2013.34

access: closed

type: Conference or Workshop Paper

metadata version: 2023-06-26

- view
  authority control:
- export record
  dblp key:
  - conf/focs/ForbesS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/ForbesS13
Michael A. Forbes, Amir Shpilka:
Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs. FOCS 2013: 243-252

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.