Alexander Perekrestenko
From MaRDI portal
Person:3540132
Available identifiers
zbMath Open perekrestenko.alexanderMaRDI QIDQ3540132
List of research outcomes
![]() | This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon! |
Publication | Date of Publication | Type |
---|---|---|
Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard | 2008-11-20 | Paper |
Research outcomes over time
This page was built for person: Alexander Perekrestenko