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

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
1
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
2
A complete dichotomy rises from the capture of vanishing signatures. (English)
SIAM J. Comput. 45, No. 5, 1671-1728 (2016).
WorldCat.org
3
Some remarks on real numbers induced by first-order spectra. (English)
Notre Dame J. Formal Logic 57, No. 3, 355-368 (2016).
WorldCat.org
4
Efficient algorithms for membership in Boolean hierarchies of regular languages. (English)
Theor. Comput. Sci. 646, 86-108 (2016).
WorldCat.org
5
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
6
The inapproximability for the $(0,1)$-additive number. (English)
Discrete Math. Theor. Comput. Sci. 17, No. 3, 217-226, electronic only (2016).
WorldCat.org
7
Deciding emptiness of the Gomory-chvátal closure is NP-complete, even for a rational polyhedron containing no integer point. (English)
Louveaux, Quentin (ed.) et al., Integer programming and combinatorial optimization. 18th international conference, IPCO 2016, Liège, Belgium, June 1‒3, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-33460-8/pbk; 978-3-319-33461-5/ebook). Lecture Notes in Computer Science 9682, 387-397 (2016).
WorldCat.org
8
Constraining cycle alternations in model checking for interval temporal logic. (English)
Crescenzi, Pierluigi (ed.) et al., Proceedings of ICTCS 2015, the 16th Italian conference on theoretical computer science, Firenze, Italy, September 9‒11, 2015. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 322, 211-226, electronic only (2016).
WorldCat.org
9
Correcting gene trees by leaf insertions: complexity and approximation. (English)
Crescenzi, Pierluigi (ed.) et al., Proceedings of ICTCS 2015, the 16th Italian conference on theoretical computer science, Firenze, Italy, September 9‒11, 2015. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 322, 35-50, electronic only (2016).
WorldCat.org
10
On the algorithmic complexity of zero-sum edge-coloring. (English)
Inf. Process. Lett. 116, No. 11, 660-667 (2016).
WorldCat.org
11
Bi-Lipschitz bijection between the Boolean cube and the Hamming ball. (English)
Isr. J. Math. 212, No. 2, 677-703 (2016).
WorldCat.org
12
Complexity of a disjoint matching problem on bipartite graphs. (English)
Inf. Process. Lett. 116, No. 10, 649-652 (2016).
WorldCat.org
13
Improved hardness results for unique shortest vector problem. (English)
Inf. Process. Lett. 116, No. 10, 631-637 (2016).
WorldCat.org
14
A note on the complexity of computing the number of reachable vertices in a digraph. (English)
Inf. Process. Lett. 116, No. 10, 628-630 (2016).
WorldCat.org
15
On computational complexity of length embeddability of graphs. (English)
Discrete Math. 339, No. 11, 2605-2612 (2016).
WorldCat.org
16
A new characterization of $P_k$-free graphs. (English)
Algorithmica 75, No. 1, 205-217 (2016).
WorldCat.org
17
Set automata. (English)
Int. J. Found. Comput. Sci. 27, No. 2, 187-214 (2016).
WorldCat.org
18
Minimal and hyper-minimal biautomata. (English)
Int. J. Found. Comput. Sci. 27, No. 2, 161-185 (2016).
WorldCat.org
19
Win-win kernelization for degree sequence completion problems. (English)
J. Comput. Syst. Sci. 82, No. 6, 1100-1111 (2016).
WorldCat.org
20
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 5338 total

Valid XHTML 1.0 Transitional Valid CSS!