Arnaud Durand 0001

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 Miki Hermann

> Home > Persons > Arnaud Durand 0001

Publications

2012
[j14]
- view
  authority control:
- export record
  dblp key:
  - journals/mst/DurandHN12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/DurandHN12
Arnaud Durand, Miki Hermann, Gustav Nordh:
Trichotomies in the Complexity of Minimal Inference. Theory Comput. Syst. 50(3): 446-491 (2012)
2009
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/lics/DurandHN09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lics/DurandHN09
Arnaud Durand, Miki Hermann, Gustav Nordh:
Trichotomy in the Complexity of Minimal Inference. LICS 2009: 387-396
2008
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/DurandH08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/DurandH08
Arnaud Durand, Miki Hermann:
On the counting complexity of propositional circumscription. Inf. Process. Lett. 106(4): 164-170 (2008)
2005
[j6]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/DurandHK05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/DurandHK05
Arnaud Durand, Miki Hermann, Phokion G. Kolaitis:
Subtractive reductions and complete problems for counting complexity classes. Theor. Comput. Sci. 340(3): 496-513 (2005)
2003
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/stacs/DurandH03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/DurandH03
Arnaud Durand, Miki Hermann:
The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete. STACS 2003: 451-462
2002
[j3]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/DurandHJ02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/DurandHJ02
Arnaud Durand, Miki Hermann, Laurent Juban:
On the complexity of recognizing the Hilbert basis of a linear diophantine system. Theor. Comput. Sci. 270(1-2): 625-642 (2002)
2000
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/mfcs/DurandHK00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/DurandHK00
Arnaud Durand, Miki Hermann, Phokion G. Kolaitis:
Subtractive Reductions and Complete Problems for Counting Complexity Classes. MFCS 2000: 323-332
1999
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/mfcs/DurandHJ99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/DurandHJ99
Arnaud Durand, Miki Hermann, Laurent Juban:
On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System. MFCS 1999: 92-102

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.