Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A simple proof that AND-compression of NP-complete problems is hard."

Holger Dell (2014)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2022-09-27

- view
  - electronic edition @ weizmann.ac.il (open access)
- export record
  dblp key:
  - journals/eccc/Dell14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/Dell14
Holger Dell:
A simple proof that AND-compression of NP-complete problems is hard. Electron. Colloquium Comput. Complex. TR14 (2014)

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.