Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 4802 total

Scheduling a variable maintenance and linear deteriorating jobs on a single machine. (English)
Inf. Process. Lett. 115, No. 1, 33-39 (2015).
WorldCat.org
1
Continuous-time orbit problems are decidable in polynomial-time. (English)
Inf. Process. Lett. 115, No. 1, 11-14 (2015).
WorldCat.org
2
Some results on determinants and inverses of nonsingular pentadiagonal matrices. (English)
J. Comput. Appl. Math. 275, 447-455 (2015).
WorldCat.org
3
Network verification via routing table queries. (English)
J. Comput. Syst. Sci. 81, No. 1, 234-248 (2015).
WorldCat.org
4
Complexity information flow in a multi-threaded imperative language. (English)
Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 11th annual conference, TAMC 2014, Chennai, India, April 11‒13, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-06088-0/pbk). Lecture Notes in Computer Science 8402, 124-140 (2014).
WorldCat.org
5
A PSPACE-complete first-order fragment of computability logic. (English)
ACM Trans. Comput. Log. 15, No. 1, Article No. 1, 11 p. (2014).
WorldCat.org
6
On computational complexity of impossible differential cryptanalysis. (English)
Inf. Process. Lett. 114, No. 5, 252-255 (2014).
WorldCat.org
7
A simpler counterexample to a long-standing conjecture on the complexity of Bryant’s apply algorithm. (English)
Inf. Process. Lett. 114, No. 3, 124-129 (2014).
WorldCat.org
8
Comparison of the quasi-inverses of the Kronecker sum and product of matrices over complete commutative dioids with applications. (English)
Linear Algebra Appl. 448, 22-36 (2014).
WorldCat.org
9
Gene tree correction for reconciliation and species tree inference: complexity and algorithms. (English)
J. Discrete Algorithms 25, 51-65 (2014).
WorldCat.org
10
Computing preferred labellings by exploiting sccs and most sceptically rejected arguments. (English)
Black, Elizabeth (ed.) et al., Theory and applications of formal argumentation. Second international workshop, TAFA 2013, Beijing, China, August 3‒5, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-642-54372-2/pbk). Lecture Notes in Computer Science 8306. Lecture Notes in Artificial Intelligence, 194-208 (2014).
WorldCat.org
11
DFA with a bounded activity level. (English)
Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 8th international conference, LATA 2014, Madrid, Spain, March 10‒14, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-04920-5/pbk). Lecture Notes in Computer Science 8370, 478-489 (2014).
WorldCat.org
12
Complexity and approximation for traveling salesman problems with profits. (English)
Theor. Comput. Sci. 531, 54-65 (2014).
WorldCat.org
13
Complexity insights of the minimum duplication problem. (English)
Theor. Comput. Sci. 530, 66-79 (2014).
WorldCat.org
14
On the evaluation at $( - ι,ι)$ of the Tutte polynomial of a binary matroid. (English)
J. Algebr. Comb. 39, No. 1, 141-152 (2014).
WorldCat.org
15
Computational aspects of uncertainty profiles and angel-daemon games. (English)
Theory Comput. Syst. 54, No. 1, 83-110 (2014).
WorldCat.org
16
Linear dependent types in a call-by-value scenario. (English)
Sci. Comput. Program. 84, 77-100 (2014).
WorldCat.org
17
Mechanisms for fair allocation problems: no-punishment payment rules in verifiable settings. (English)
J. Artif. Intell. Res. (JAIR) 49, 403-449 (2014).
WorldCat.org
18
Space complexity equivalence of P systems with active membranes and Turing machines. (English)
Theor. Comput. Sci. 529, 69-81 (2014).
WorldCat.org
19
Complexity and algorithms for recognizing polar and monopolar graphs. (English)
Theor. Comput. Sci. 528, 1-11 (2014).
WorldCat.org
20
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 4802 total

Valid XHTML 1.0 Transitional Valid CSS!