"Sparse Hard Sets for P."

Dieter van Melkebeek, Mitsunori Ogihara (1997)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2016-03-30

- no documents available
- export record
  dblp key:
  - conf/birthday/MelkebeekO97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/birthday/MelkebeekO97
Dieter van Melkebeek, Mitsunori Ogihara:
Sparse Hard Sets for P. Advances in Algorithms, Languages, and Complexity 1997: 191-208

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.