Full name Familienname, Vorname
Hermann, Miki
 


Results 1-19 of 19 (Search time: 0.003 seconds).

PreviewAuthor(s)TitleTypeIssue Date
1Behrisch-2021-On hardness of some Boolean counting CSPs-vor.pdf.jpgBehrisch, Mike ; Hermann, Miki On hardness of some Boolean counting CSPsPresentation Vortrag 4-Jun-2021
2Hermann, Miki ; Salzer, Gernot MCP: Capturing Big Data by Satisfiability (Tool Description)Konferenzbeitrag Inproceedings 2021
3Behrisch, Mike ; Hermann, Miki ; Mengel, Stefan ; Salzer, Gernot Minimal Distance of Propositional ModelsArtikel Article 2019
4Behrisch, Mike ; Hermann, Miki Strong partial clones, weak bases and applications to counting complexityPräsentation Presentation2019
5Behrisch Mike - 2018 - Minimal Distance of Propositional Models.pdf.jpgBehrisch, Mike ; Hermann, Miki ; Mengel, Stefan ; Salzer, Gernot Minimal Distance of Propositional ModelsArticle Artikel 2018
6Behrisch, Mike ; Hermann, Miki ; Mengel, Stefan ; Salzer, Gernot The Next Whisky BarPräsentation Presentation2016
7Behrisch, Mike ; Salzer, Gernot ; Hermann, Miki ; Mengel, Stefan Approximating closest homomorphisms into Boolean CSP-templatesPräsentation Presentation2016
8Salzer, Gernot ; Hermann, Miki The Next Whisky BarKonferenzbeitrag Inproceedings 2016
9Salzer, Gernot ; Behrisch, Mike ; Hermann, Miki As Close as It GetsKonferenzbeitrag Inproceedings2016
10Salzer, Gernot ; Behrisch, Mike ; Hermann, Miki Minimal Distance of Propositional ModelsPreprint Preprint2015
11Hermann, Miki ; Pichler, Reinhard Counting complexity of propositional abductionArtikel Article2010
12Chepoi, Victor ; Creignou, Nadia ; Hermann, Miki ; Salzer, Gernot The Helly Property and Satisfiability of Boolean Formulas Defined on Set FamiliesArtikel Article2010
13Hermann, Miki ; Pichler, Reinhard Complexity of Counting the Optimal SolutionArtikel Article2009
14Salzer, Gernot ; Chepoi, V ; Creignou, Nadia ; Hermann, Miki Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed LogicsKonferenzbeitrag Inproceedings 2008
15Creignou, Nadia ; Hermann, Miki ; Krokhin, Andrei ; Salzer, Gernot Complexity of Clausal Constraints Over ChainsArtikel Article2008
16Hermann, Miki ; Pichler, Reinhard Complexity of Counting the Optimal SolutionsKonferenzbeitrag Inproceedings2008
17Gil, Ángel J. ; Hermann, Miki ; Salzer, Gernot ; Zanuttini, Bruno Efficient Algorithms for Description Problems over Finite Totally Ordered DomainsArtikel Article 2008
18Hermann, Miki ; Pichler, Reinhard Counting Complexity of Propositional AbductionKonferenzbeitrag Inproceedings 2007
19Gil, Angel ; Hermann, Miki ; Salzer, Gernot ; Zanuttini, Bruno Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered DomainsPräsentation Presentation2004



Results 1-1 of 1 (Search time: 0.002 seconds).

PreviewAuthor(s)TitleTypeIssue Date
1Ciabattoni, Agata ; Terui, Kazushige Modular cut-elimination: finding proofs or counterexamplesKonferenzbeitrag Inproceedings2006