Travelled to:1 × Spain
Collaborated with:∅
Talks about:nondiscrimin (1) minimalist (1) unbound (1) scrambl (1) grammar (1) barrier (1) hard (1)
Person: Alexander Perekrestenko
DBLP: Perekrestenko:Alexander
Contributed to:
Wrote 1 papers:
- LATA-2008-Perekrestenko #bound #np-hard
- Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard (AP), pp. 421–432.












