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

Exponential examples of solving parity games. (English)
Comput. Math. Math. Phys. 56, No. 4, 688-697 (2016); translation from Zh. Vychisl. Mat. Mat. Fiz. 56, No. 4, 694-703 (2016).
WorldCat.org
1
Minimum cost paths over dynamic networks. (English)
Pióro, Michał (ed.) et al., Proceedings of the 7th international network optimization conference (INOC), Warsaw, Poland, May 18‒20, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 52, 343-350, electronic only (2016).
WorldCat.org
2
On the computational complexity of the virtual network embedding problem. (English)
Pióro, Michał (ed.) et al., Proceedings of the 7th international network optimization conference (INOC), Warsaw, Poland, May 18‒20, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 52, 213-220, electronic only (2016).
WorldCat.org
3
Scheduling under linear constraints. (English)
Eur. J. Oper. Res. 253, No. 2, 290-297 (2016).
WorldCat.org
4
Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty. (English)
Eur. J. Oper. Res. 252, No. 2, 367-375 (2016).
WorldCat.org
5
An alternative approach for proving the NP-hardness of optimization problems. (English)
Eur. J. Oper. Res. 248, No. 1, 52-58 (2016).
WorldCat.org
6
Holant problems for 3-regular graphs with complex edge functions. (English)
Theory Comput. Syst. 59, No. 1, 133-158 (2016).
WorldCat.org
7
The computational complexity of iterated elimination of dominated strategies. (English)
Theory Comput. Syst. 59, No. 1, 52-75 (2016).
WorldCat.org
8
The label cut problem with respect to path length and label frequency. (English)
Theor. Comput. Sci. 648, 72-83 (2016).
WorldCat.org
9
Complexity of the game domination problem. (English)
Theor. Comput. Sci. 648, 1-7 (2016).
WorldCat.org
10
Novel dual discounting functions for the Internet shopping optimization problem: new algorithms. (English)
J. Sched. 19, No. 3, 245-255 (2016).
WorldCat.org
11
Acyclic colorings of graphs with bounded degree. (English)
Sci. China, Math. 59, No. 7, 1427-1440 (2016).
WorldCat.org
12
Tractability-preserving transformations of global cost functions. (English)
Artif. Intell. 238, 166-189 (2016).
WorldCat.org
13
Design of an RMPC with a time-varying terminal constraint set for tracking problem. (English)
Int. J. Robust Nonlinear Control 26, No. 12, 2623-2642 (2016).
WorldCat.org
14
On the hardness of switching to a small number of edges. (English)
Dinh, Thang N. (ed.) et al., Computing and combinatorics. 22nd international conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2‒4, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-42633-4/pbk; 978-3-319-42634-1/ebook). Lecture Notes in Computer Science 9797, 159-170 (2016).
WorldCat.org
15
A complete dichotomy rises from the capture of vanishing signatures. (English)
SIAM J. Comput. 45, No. 5, 1671-1728 (2016).
WorldCat.org
16
Some remarks on real numbers induced by first-order spectra. (English)
Notre Dame J. Formal Logic 57, No. 3, 355-368 (2016).
WorldCat.org
17
Efficient algorithms for membership in Boolean hierarchies of regular languages. (English)
Theor. Comput. Sci. 646, 86-108 (2016).
WorldCat.org
18
Alternating demon space Is closed under complement and other simulations for sublogarithmic space. (English)
Brlek, Srečko (ed.) et al., Developments in language theory. 20th international conference, DLT 2016, Montréal, Canada, July 25‒28, 2016. Proceedings. Berlin: Springer (ISBN 978-3-662-53131-0/pbk; 978-3-662-53132-7/ebook). Lecture Notes in Computer Science 9840, 190-202 (2016).
WorldCat.org
19
The inapproximability for the $(0,1)$-additive number. (English)
Discrete Math. Theor. Comput. Sci. 17, No. 3, 217-226, electronic only (2016).
WorldCat.org
20
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 5367 total

Valid XHTML 1.0 Transitional Valid CSS!