The following pages link to Arfst Nickelsen (Q2575740):
Displayed 12 items.
- One query reducibilities between partial information classes (Q2575741) (← links)
- (Q4281521) (← links)
- (Q4551344) (← links)
- Algebraic Properties for Selector Functions (Q4651516) (← links)
- (Q4699320) (← links)
- (Q4779174) (← links)
- (Q4785453) (← links)
- (Q4808678) (← links)
- On polynomially D verbose sets (Q5048933) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311116) (← links)
- The Complexity of Finding Paths in Graphs with Bounded Independence Number (Q5317191) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492883) (← links)