"The Complexity of Near-Optimal Programmable Logic Array Folding."

S. S. Ravi, Errol L. Lloyd (1988)

> Home

Details and statistics

DOI: 10.1137/0217045

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/RaviL88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/RaviL88
S. S. Ravi, Errol L. Lloyd:
The Complexity of Near-Optimal Programmable Logic Array Folding. SIAM J. Comput. 17(4): 696-710 (1988)

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.