Arfst Nickelsen

Available identifiers

zbMath Open nickelsen.arfstMaRDI QIDQ2575740

List of research outcomes

Publication	Date of Publication	Type
On polynomially D verbose sets	2022-11-09	Paper
Mathematical Foundations of Computer Science 2005	2006-10-20	Paper
One query reducibilities between partial information classes	2005-12-06	Paper
The Complexity of Finding Paths in Graphs with Bounded Independence Number	2005-09-16	Paper
Mathematical Foundations of Computer Science 2004	2005-08-22	Paper
Algebraic Properties for Selector Functions	2005-02-21	Paper
https://portal.mardi4nfdi.de/entity/Q4808678	2004-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q4785453	2003-02-25	Paper
https://portal.mardi4nfdi.de/entity/Q4779174	2002-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q4551344	2002-09-05	Paper
https://portal.mardi4nfdi.de/entity/Q4699320	1997-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4281521	1994-04-07	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Arfst Nickelsen