"An O(n^lg k . 2^n/2) Time and O(k . 2^n/k) Space Algorithm for Certain ..."

Jozef Vyskoc (1987)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2003-11-19

- no documents available
- export record
  dblp key:
  - journals/tcs/Vyskoc87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Vyskoc87
Jozef Vyskoc:
An O(n^lg k . 2^n/2) Time and O(k . 2^n/k) Space Algorithm for Certain NP-Complete Problems. Theor. Comput. Sci. 51: 221-227 (1987)

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.