Arfst Nickelsen

From MaRDI portal
Person:2575740

Available identifiers

zbMath Open nickelsen.arfstMaRDI QIDQ2575740

List of research outcomes





PublicationDate of PublicationType
On polynomially \(\mathcal{D}\)-verbose sets2022-11-09Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
One query reducibilities between partial information classes2005-12-06Paper
The Complexity of Finding Paths in Graphs with Bounded Independence Number2005-09-16Paper
Mathematical Foundations of Computer Science 20042005-08-22Paper
Algebraic Properties for Selector Functions2005-02-21Paper
https://portal.mardi4nfdi.de/entity/Q48086782004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47854532003-02-25Paper
https://portal.mardi4nfdi.de/entity/Q47791742002-11-25Paper
https://portal.mardi4nfdi.de/entity/Q45513442002-09-05Paper
https://portal.mardi4nfdi.de/entity/Q46993201997-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42815211994-04-07Paper

Research outcomes over time

This page was built for person: Arfst Nickelsen

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:2575740&oldid=7162575"
Powered by MediaWiki