History

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 4628 total

Tree projections and structural decomposition methods: minimality and game-theoretic characterization. (English)
Theor. Comput. Sci. 522, 95-114 (2014).
1
The guarding game is E-complete. (English)
Theor. Comput. Sci. 521, 92-106 (2014).
2
Safe recursion revisited. I: Categorical semantics for lower complexity. (English)
Theor. Comput. Sci. 515, 19-45 (2014).
3
Automatic evaluations of cross-derivatives. (English)
Math. Comput. 83, No. 285, 251-274 (2014).
4
Computing of B-series by automatic differentiation. (English)
Discrete Contin. Dyn. Syst. 34, No. 3, 903-914 (2014).
5
Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times. (English)
J. Sched. 16, No. 3, 337-346 (2013).
6
Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity. (English)
J. Sched. 16, No. 2, 185-198 (2013).
7
Complexity of linear Boolean operators. (English)
Found. Trends Theor. Comput. Sci. 9, No. 1, 1-123 (2013).
8
Analysis of multi-stage open shop processing systems. (English)
Math. Program. 142, No. 1-2 (A), 331-348 (2013).
9
On the complexity of computing the Hausdorff distance. (English)
J. Complexity 29, No. 3-4, 248-262 (2013).
10
Revisiting the complexity of and/or graph solution. (English)
J. Comput. Syst. Sci. 79, No. 7, 1156-1163 (2013).
11
Tractable counting of the answers to conjunctive queries. (English)
J. Comput. Syst. Sci. 79, No. 6, 984-1001 (2013).
12
$\mathsf{PPAD}$-completeness of polyhedral versions of Sperner’s lemma. (English)
Discrete Math. 313, No. 15, 1594-1599 (2013).
13
The complexity of the bootstraping percolation and other problems. (English)
Theor. Comput. Sci. 504, 73-82 (2013).
14
Groups synchronizing a transformation of non-uniform kernel. (English)
Theor. Comput. Sci. 498, 1-9 (2013).
15
Algorithmic complexity of proper labeling problems. (English)
Theor. Comput. Sci. 495, 25-36 (2013).
16
Finding approximate and constrained motifs in graphs. (English)
Theor. Comput. Sci. 483, 10-21 (2013).
17
The complexity of free-flood-it on $2\times n$ boards. (English)
Theor. Comput. Sci. 500, 25-43 (2013).
18
Roles and teams hedonic game. (English)
Perny, Patrice (ed.) et al., Algorithmic decision theory. Third international conference, ADT 2013, Bruxelles, Belgium, November 12‒14, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-41574-6/pbk). Lecture Notes in Computer Science 8176. Lecture Notes in Artificial Intelligence, 351-362 (2013).
19
Possible winners in approval voting. (English)
Perny, Patrice (ed.) et al., Algorithmic decision theory. Third international conference, ADT 2013, Bruxelles, Belgium, November 12‒14, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-41574-6/pbk). Lecture Notes in Computer Science 8176. Lecture Notes in Artificial Intelligence, 57-70 (2013).
20
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 4628 total