"MCSP is Hard for Read-Once Nondeterministic Branching Programs."

Ludmila Glinskih, Artur Riazanov (2022)

> Home

Details and statistics

DOI: 10.1007/978-3-031-20624-5_38

access: closed

type: Conference or Workshop Paper

metadata version: 2022-11-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/latin/GlinskihR22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/latin/GlinskihR22
Ludmila Glinskih, Artur Riazanov:
MCSP is Hard for Read-Once Nondeterministic Branching Programs. LATIN 2022: 626-640

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.