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

On a connection between small set expansions and modularity clustering. (English)
Inf. Process. Lett. 114, No. 7, 349-352 (2014).
WorldCat.org
1
On lattices of regular sets of natural integers closed under decrementation. (English)
Inf. Process. Lett. 114, No. 4, 197-202 (2014).
WorldCat.org
2
Excessively duplicating patterns represent non-regular languages. (English)
Inf. Process. Lett. 114, No. 3, 85-93 (2014).
WorldCat.org
3
Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation. (English)
Inf. Process. Lett. 113, No. 19-21, 719-722 (2013).
WorldCat.org
4
Hypercomputation: fantasy or reality? A position paper. (English)
Parallel Process. Lett. 23, No. 1, Article ID 1350005, 12 p. (2013).
WorldCat.org
5
Algorithmic solution of higher type equations. (English)
J. Log. Comput. 23, No. 4, 839-854 (2013).
WorldCat.org
6
On martin-Löf convergence of solomonoff’s mixture. (English)
Chan, T-H. Hubert (ed.) et al., Theory and applications of models of computation. 10th international conference, TAMC 2013, Hong Kong, China, May 20‒22, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38235-2/pbk). Lecture Notes in Computer Science 7876, 212-223 (2013).
WorldCat.org
7
Theory of computation. (English)
Oxford: Oxford University Press (ISBN 978-0-19-808458-7/pbk). xiv, 529~p. \sterling~15.99 (2013).
WorldCat.org
8
Logical foundations of mathematics and computational complexity. A gentle introduction. (English)
Springer Monographs in Mathematics. Cham: Springer (ISBN 978-3-319-00118-0/hbk; 978-3-319-00119-7/ebook). xiv, 695~p. EUR~149.79; \$~189.00/net (2013).
WorldCat.org
9
Satisfiability problem for modal logic with global counting operators coded in binary is {\sc NExpTime}-complete. (English)
Inf. Process. Lett. 113, No. 1-2, 34-38 (2013).
WorldCat.org
10
LP decoding of codes with expansion parameter above $2/3$. (English)
Inf. Process. Lett. 113, No. 7, 225-228 (2013).
WorldCat.org
11
Software for exact integration of polynomials over polyhedra. (English)
Comput. Geom. 46, No. 3, 232-252 (2013).
WorldCat.org
12
Universal map for cellular automata. (English)
Phys. Lett., A 376, No. 40-41, 2645-2657 (2012).
WorldCat.org
13
Computability in analysis. (Chinese)
J. Ningxia Univ., Nat. Sci. Ed. 33, No. 1, 6-13 (2012).
WorldCat.org
14
On the inapproximability of maximum intersection problems. (English)
Inf. Process. Lett. 112, No. 19, 723-727 (2012).
WorldCat.org
15
The “Seven Dwarfs” of symbolic computation. (English)
Langer, Ulrich (ed.) et al., Numerical and symbolic scientific computing. Progress and prospects. New York, NY: Springer (ISBN 978-3-7091-0793-5/pbk; 978-3-7091-0794-2/ebook). Texts \& Monographs in Symbolic Computation, 95-104 (2012).
WorldCat.org
16
On the computational capacity of parallel communicating finite automata. (English)
Int. J. Found. Comput. Sci. 23, No. 3, 713-732 (2012).
WorldCat.org
17
Undecidability of infinite Post correspondence problem for instances of size 8. (English)
RAIRO, Theor. Inform. Appl. 46, No. 3, 451-457 (2012).
WorldCat.org
18
An alternate proof of Statman’s finite completeness theorem. (English)
Inf. Process. Lett. 112, No. 14-15, 612-616 (2012).
WorldCat.org
19
A $K$-trivial set which is not jump traceable at certain orders. (English)
Inf. Process. Lett. 112, No. 13, 544-547 (2012).
WorldCat.org
20
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 323 total

Valid XHTML 1.0 Transitional Valid CSS!