Used together with:
unbound
(1)
barrier
(1)
grammar
(1)
scrambl
(1)
hard
(1)
Stem
nondiscrimin$ (
all stems
)
1 papers:
LATA-2008-Perekrestenko
#bound
#np-hard
Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard (
AP
), pp. 421–432.
Bibliography of Software Language Engineering in Generated Hypertext
(
BibSLEIGH
) is created and maintained by
Dr. Vadim Zaytsev
.
Hosted as a part of
SLEBOK
on
GitHub
.