New answers tagged approximation-hardness
4
votes
Finding a minimal context free grammar that recognizes a finite set of strings of bounded length
The following inapproximability result is known (Theorem 17 in Gruber/Holzer/Wolfsteiner, DLT 2018):
Given a context-free grammar of size $s$ generating a finite
language $L$, it is impossible to ...
Top 50 recent answers are included
Related Tags
approximation-hardness × 191approximation-algorithms × 90
cc.complexity-theory × 76
np-hardness × 35
graph-theory × 24
ds.algorithms × 21
reference-request × 20
graph-algorithms × 17
approximation × 17
complexity-classes × 13
pcp × 11
optimization × 10
sat × 10
set-cover × 10
counting-complexity × 9
graph-colouring × 9
unique-games-conjecture × 8
clique × 6
csp × 6
co.combinatorics × 4
linear-programming × 4
semidefinite-programming × 4
max-cut × 4
submodularity × 4
apx × 4