"NP-completeness of combinatorial problems with unary notation for integers."

Martti Penttonen (1980)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2020-09-18

- no documents available
- export record
  dblp key:
  - journals/fuin/Penttonen80
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fuin/Penttonen80
Martti Penttonen:
NP-completeness of combinatorial problems with unary notation for integers. Fundam. Informaticae 3(3): 397- (1980)

a service of

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.