Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Bodo Manthey

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 Jan Arpe

> Home > Persons > Bodo Manthey

Publications

2009
[j14]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/ArpeM09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/ArpeM09
Jan Arpe, Bodo Manthey:
Approximability of Minimum AND-Circuits. Algorithmica 53(3): 337-357 (2009)
2006
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/swat/ArpeM06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/swat/ArpeM06
Jan Arpe, Bodo Manthey:
Approximability of Minimum AND-Circuits. SWAT 2006: 292-303
[i8]
- view
  - electronic edition @ dagstuhl.de (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dagstuhl/ArpeM06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/ArpeM06
Jan Arpe, Bodo Manthey:
Approximability of Minimum AND-Circuits. Complexity of Boolean Functions 2006
[i5]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/ArpeM06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ArpeM06
Jan Arpe, Bodo Manthey:
Approximability of Minimum AND-Circuits. Electron. Colloquium Comput. Complex. TR06 (2006)

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.