Computational complexity of the csHMM alignment algorithm
Algorithm and computational complexity of Insulin
... The first aminoacid in this example has 10 atoms, the second one 22, the third one 19, etc. They have exactly these numbers of atoms because there are many codes in the insulin molecule, analog codes, and other voded ...
26
The Computational Complexity of Tomita’s Algorithm
... parsing algorithm adapts K nuth’s (1967) well-known parsing algo rithm for LR()t) grammars to non-LR grammars, including ambiguous gram ...nuth’s algorithm is provably efficient: it requires at most 0 (n |G ...
6
Qualitative Reasoning about Relative Directions : Computational Complexity and Practical Algorithm
... The completeness of the a-closure method is however not guaranteed, as consistency of conjunctions of any three atomic constraints of a formula ϕ does not necessarily induce consistency of ϕ itself. As an example, Figure ...
112
3. Computational Complexity.
... no algorithm will be able to solve (examples are Hilbert’s tenth problem, deciding the solvability of polyno- mial equations in integers, and the problem of deciding whether or not a finitely presented group is ...
23
Algebraic Methods in Computational Complexity
... PSPACE algorithm that given n, s, r in unary outputs a set of n-tuples over the rationals of size poly(n, s, r), with poly(n, s, r) bit complexity, that hits all n-variate polynomials of degree-r that are ...
21
Computational Complexity and Tort Deterrence
... -approximation algorithm for the problem is a polynomial-time algorithm whose output ex satis…es (i) f(x ) f ( ex) f (x ) for some 1, in the case of a minimization problem, or (ii) f (x ) f ( ex) f (x ) for ...
26
On the Computational Complexity of the Domination Game
... to check at most n times if a move v is legal and if N [v] ∪ S = V (G). To this end we first compute S and store |S| which is done in time O(n). After that when going in the loop for vertex v, we compute |N [v] \ S|. It ...
8
The Computational Complexity of Linear Optics
... Shor’s algorithm has two significant ...of complexity theory, it is no means settled that factoring is classically ...of complexity classes or other disastrous theoretical ...
110
Improve computational complexity of sobel edge detection using parallel contract anytime algorithm
... After that, the edge detection process runs in GPU. Again, used contract-time anytime algorithm to detect the edges. We have calculated the time for Sobel operator in CUDA environment and took the time for ...
44
Cognate Discovery and Alignment in Computational Etymology
... the algorithm above, we will find the best alignment of two words in terms of ...the alignment can also be performed by using similarity ...similar alignment will get large positive score and ...
51
Computational Complexity of Statistical Machine Translation
... Viterbi Alignment is itself a special type of covering problem and it remains to be seen whether some of the techniques devel- oped for covering algorithms are useful for finding good approximations to Viterbi ...
8
Turing Machines and Understanding Computational Complexity
... For the contemporary reader there should be nothing mysterious in the con- cept of a general-purpose computer which can perform any computation when supplied with an appropriate program. The surprising thing is that a ...
9
The Computational Complexity of Avoiding Conversational Implicatures
... These prefer- ence rules can be incorporated into a polynomial- time algorithm for generating free-of-false- implicatures referring expressions, while some alter- native [r] ...
8
Computational Complexity of Weighted Threshold Games
... practice. For example, the voting system of the European Union is a combination of weighted threshold games (Bil- bao et al. 2002). From previous research, we know that for weighted threshold games it is #P-hard to ...
6
The Computational Complexity of Integer Programming with Alternations
... References 1 S. Arora and B. Barak. Computational complexity: A modern approach. Cambridge Uni- versity Press, Cambridge, 2009. doi:10.1017/CBO9780511804090. 2 A. Barvinok. A polynomial time ...
18
Invariant Theory, Tensors and Computational Complexity
... identity, then it is likely that for a random choice, both sides will not match. For example, if we are trying to verify whether (x − 1) 2 + y 2 = (x + y − 1) 2 , then this will not be true unless we end up assigning in ...
118
The computational complexity of approximation of partition functions
... Lemma 2.17. If σ has only local contours then σ ∗ has only local components. Proof. Suppose to the contrary that σ ∗ has non-local component K. Consider first the case of a cross component. So suppose K reaches both the ...
225
Algebraic and Combinatorial Methods in Computational Complexity
... the complexity classes NL and LogCFL, which are two well-studied complexity classes contained in ...UL/poly algorithm for reachability, but we prove that in fact this implies an L/poly ...
20
The Computational Complexity of Untrapped Choice Procedures
... In this paper, we define two versions of Untrapped set (weak and strong Un- trapped sets) over a finite set of alternatives. These versions, considered as choice procedures, extend the notion of Untrapped set in a more ...
10
The Complexity of Math Problems – Linguistic, or Computational?
... { takuya-matsuzaki,arai } @nii.ac.jp; { iwane,anai } @jp.fujitsu.com Abstract We present a simple, logic-based archi- tecture for solving math problems writ- ten in natural language. A problem is firstly translated to a ...
9