| tech,20-1-H05-1101,ak | been adopted in the literature on <term> | machine translation | </term> . These <term> models </term> can be | #5698 This paper investigates some computational problems associated with probabilistic translation models that have recently been adopted in the literature on machine translation . | |
| other,5-3-H05-1101,ak | <term> hardness results </term> for the <term> | class NP | </term> are reported , along with an <term> | #5725 Two hardness results for the class NP are reported, along with an exponential time lower-bound for certain classes of algorithms that are currently used in the literature. |
