`Travelled to:`

1 × France

1 × Japan

1 × Poland

1 × USA

`Collaborated with:`

T.Husfeldt D.v.Melkebeek M.Bläser A.Björklund M.Wahlen

`Talks about:`

polynomi (3) time (3) exponenti (2) complex (2) hierarchi (1) restrict (1) nontrivi (1) sparsif (1) satisfi (1) problem (1)

## Person: Holger Dell

### DBLP: Dell:Holger

### Contributed to:

### Wrote 4 papers:

- ICALP-v1-2015-BjorklundDH #exponential #problem #random #set #strict
- The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems (AB, HD, TH), pp. 231–242.
- ICALP-v1-2010-DellHW #complexity #exponential #polynomial
- Exponential Time Complexity of the Permanent and the Tutte Polynomial (HD, TH, MW), pp. 426–437.
- STOC-2010-DellM #polynomial #satisfiability
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses (HD, DvM), pp. 251–260.
- ICALP-2007-BlaserD #complexity #polynomial
- Complexity of the Cover Polynomial (MB, HD), pp. 801–812.