Travelled to:1 × China
1 × Portugal
1 × USA
Collaborated with:P.Zumstein R.A.Moser
Talks about:unsatisfi (1) exponenti (1) algorithm (1) schöning (1) derandom (1) conflict (1) satisfi (1) famili (1) need (1) mani (1)
Person: Dominik Scheder
DBLP: Scheder:Dominik
Contributed to:
2011
20082007Wrote 3 papers:
- STOC-2011-MoserS #algorithm #satisfiability
- A full derandomization of schöning’s k-SAT algorithm (RAM, DS), pp. 245–252.
- SAT-2008-SchederZ #how #question #satisfiability
- How Many Conflicts Does It Need to Be Unsatisfiable? (DS, PZ), pp. 246–256.
- SAT-2007-SchederZ #exponential #product line #satisfiability
- Satisfiability with Exponential Families (DS, PZ), pp. 148–158.