Result 1 to 20 of 1912 total
EXPTIME-completeness of thorough refinement on modal transition systems. (English)
Inf. Comput. 218, 54-68 (2012).
1
On the complexity of minimizing probabilistic and quantum automata. (English)
Inf. Comput. 218, 36-53 (2012).
2
Automatic learning of subclasses of pattern languages. (English)
Inf. Comput. 218, 17-35 (2012).
3
Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings. (English)
Inf. Comput. 219, 58-70 (2012).
4
Approximate counting for complex-weighted Boolean constraint satisfaction problems. (English)
Inf. Comput. 219, 17-38 (2012).
5
Connected graph searching. (English)
Inf. Comput. 219, 1-16 (2012).
6
Restricted space algorithms for isomorphism on bounded treewidth graphs. (English)
Inf. Comput. 217, 71-83 (2012).
7
Fundamentals of session types. (English)
Inf. Comput. 217, 52-70 (2012).
8
Functorial data migration. (English)
Inf. Comput. 217, 31-51 (2012).
9
Deciding regularity of hairpin completions of regular languages in polynomial time. (English)
Inf. Comput. 217, 12-30 (2012).
10
The isomorphism problem for $k$-trees is complete for logspace. (English)
Inf. Comput. 217, 1-11 (2012).
11
The functions erf and erfc computed with arbitrary precision and explicit error bounds. (English)
Inf. Comput. 216, 72-95 (2012).
12
Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic. (English)
Inf. Comput. 216, 57-71 (2012).
13
A study of decimal left shifters for binary numbers. (English)
Inf. Comput. 216, 47-56 (2012).
14
The world\rq s shortest correct exact real arithmetic program? (English)
Inf. Comput. 216, 39-46 (2012).
15
Interrogating witnesses for geometric constraint solving. (English)
Inf. Comput. 216, 24-38 (2012).
16
Floating-point arithmetic in the Coq system. (English)
Inf. Comput. 216, 14-23 (2012).
17
A robust algorithm for geometric predicate by error-free determinant transformation. (English)
Inf. Comput. 216, 3-13 (2012).
18
Multiset rewriting for the verification of depth-bounded processes with name binding. (English)
Inf. Comput. 215, 68-87 (2012).
19
A new look at the automatic synthesis of linear ranking functions. (English)
Inf. Comput. 215, 47-67 (2012).
20
Result 1 to 20 of 1912 total