"Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs."

Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama (2017)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ISAAC.2017.58

access: open

type: Conference or Workshop Paper

metadata version: 2023-09-30

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/isaac/NagaoST17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/NagaoST17
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs. ISAAC 2017: 58:1-58:10

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.