Alexander Perekrestenko

From MaRDI portal
Person:3540132

Available identifiers

zbMath Open perekrestenko.alexanderMaRDI QIDQ3540132

List of research outcomes





PublicationDate of PublicationType
Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard2008-11-20Paper

Research outcomes over time

This page was built for person: Alexander Perekrestenko