"On NP-Completeness for Linear Machines."

Christine Gaßner (1997)

> Home

Details and statistics

DOI: 10.1006/JCOM.1997.0444

access: open

type: Journal Article

metadata version: 2025-03-03

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jc/Gassner97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jc/Gassner97
Christine Gaßner:
On NP-Completeness for Linear Machines. J. Complex. 13(2): 259-271 (1997)

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.