complexity of algorithms - peter gacs

... every element of Q(β) ∩(0, 1) has an eventually periodic β-expansion. 5. Proofs of Theorems 1 to 4 We begin by a short proof of Theorem 2. Proof of Theorem 2. Let a =(a k ) k≥1 be a non-eventually ... with linear complexity are tran- scendental. Our first result is a considerable improvement of (1). Theorem 1. Let b ≥ 2 be an integer. The complexity function of the b-ary expans...

Ngày tải lên: 16/02/2014, 06:20

... between problems, algorithms, languages, and machines. e emergence of the theory of algorithms unleashed an Age of Design where multitudes of new algorithms with ever-improving worst- case performance ... analysis of algorithms, popularized by Knuth [17][18][19][20][22], concentrates on precise characterizations of the best- case, worst-case, and average-case performance o...

Ngày tải lên: 19/02/2014, 20:20

... preferences of this core group so- lidifies their commitment to your market and helps to ensure they keep coming back week after week. Word -of- mouth Word -of- mouth is far more effec- tive than ... market is well organized, custom- ers will perform the bulk of adver- tising and marketing in their con- versations with friends and ac- quaintances (Corum, 1999). En- courage frequent sh...

Ngày tải lên: 06/03/2014, 21:20

... to offer interesting new complex- ity trade-offs, as we prove that k-boundedness and k-rankedness are EXPTIME-complete for MLIGs, and that the emptiness and membership problems are EXPTIME-complete ... translates ex- actly into 1-boundedness of the corresponding MLIGs (Salvati, 2010). Clearly, any k-ranked MLIG is also k-bounded, and conversely any n-dimensional k-bounded MLIG is (kn)-ranke...

Ngày tải lên: 16/03/2014, 23:20

... study of the pat- terns of translational equivalence exhib- ited by a variety of bitexts. The study found that the complexity of these pat- terns in every bitext was higher than sug- gested in the ... on why “syntactic” con- straints have not helped to improve statis- tical translation models, including finite- state phrase-based models, tree-to-string models, and tree-to-tree models...

Ngày tải lên: 17/03/2014, 04:20

... is NP-hard Proof: On input 3-CNF formula F of length n using the m vari- ables zl x,~, reduce 3-SAT, a known NP-complete problem, to Metarule-Membership in polynomial time. The set of ID ... theory. The gen- eralization to arbitrary sets allows a fine-grained study of one component of GPSG theory (the theory of syntactic features) with the tools of compu- tational complexit...

Ngày tải lên: 17/03/2014, 20:20

... attributive description is in- tended to communicate information about an object. This paper only addresses the problem of gen- erating free -of- false-implicatures referring expres- sions, such as utterance ... (number of open-class words, number of words, number of characters, number of com- ponents). To prove this, let Target-Components denote those components (classifi...

Ngày tải lên: 17/03/2014, 20:20

... problem) is polynomial- time solvable using the Hungarian algorithm. 3.1 Reducing Satisfiability to D A reduction proof of NP-completeness gives a con- struction by which a known NP-complete problem can ... can show that S is #P- hard, meaning that it is at least as hard as any #P- complete problem. #P is a class of counting prob- lems related to NP, and #P-hard problems are NP- hard as we...

Ngày tải lên: 23/03/2014, 17:20

... are often imple- mented on top of morphological paradigms, corresponding to different ways of building the full inflection table of a word. Compu- tationally precise lexica may use hundreds of ... system. The overall complexity of the system also has to take into account the code size of the paradigms definition itself. This pa- per evaluates the smart paradigms imple- mented in t...

Ngày tải lên: 24/03/2014, 03:20

... E Hi {} S { (-, u,, u), , (-, u,v,_,, v), (-, hi, Hi) ,-& apos ;-, (-, hie I, HIEI), (-, n, R), • • • , (-, r(k-,)l~l, R)} I order I ={ } word ] ={ } "i -{ } -{ } word classes ... O-roles of GB, subcatego- rization in HPSG, and the so-called domain of locality of TAG) again raises the issue whether non-lexical cat- egories are necessary for...

Ngày tải lên: 24/03/2014, 03:21