default search action

combined dblp search
author search
venue search
publication search

ask others

"Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121)."

Anna Gál et al. (2014)

> Home

Details and statistics

DOI: 10.4230/DAGREP.4.3.62

access: open

type: Informal or Other Publication

metadata version: 2020-07-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dagstuhl-reports/GalKRR14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dagstuhl-reports/GalKRR14
Anna Gál, Michal Koucký, Oded Regev, Rüdiger Reischuk:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121). Dagstuhl Reports 4(3): 62-84 (2014)

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.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.