Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum ..."

Oded Goldreich (2011)

> Home

Details and statistics

DOI: 10.1007/978-3-642-22670-0_11

access: closed

type: Part in Book or Collection

metadata version: 2018-11-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - books/sp/goldreich2011/Goldreich11c
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/sp/goldreich2011/Goldreich11c
Oded Goldreich:
Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs. Studies in Complexity and Cryptography 2011: 88-97

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.