Andrei A. Krokhin

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Martin Grohe

> Home > Persons > Andrei A. Krokhin

Publications

2009
[e1]
- view
- export record
  dblp key:
  - conf/dagstuhl/2009P9441
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/2009P9441
Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, Andrei A. Krokhin:
The Constraint Satisfaction Problem: Complexity and Approximability, 25.10. - 30.10.2009. Dagstuhl Seminar Proceedings 09441, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents]
[i8]
- view
  - electronic edition @ dagstuhl.de (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dagstuhl/BulatovGKK09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/BulatovGKK09
Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, Andrei A. Krokhin:
09441 Abstracts Collection - The Constraint Satisfaction Problem: Complexity and Approximability. The Constraint Satisfaction Problem: Complexity and Approximability 2009
[i7]
- view
  - electronic edition @ dagstuhl.de (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dagstuhl/BulatovGKK09a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/BulatovGKK09a
Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, Andrei A. Krokhin:
09441 Executive Summary - The Constraint Satisfaction Problem: Complexity and Approximability. The Constraint Satisfaction Problem: Complexity and Approximability 2009

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.