Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=278

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

On direct methods of realization of normal algorithms by Turing machines
G.V. Babikov
Lecture Notes in Computer Science 278, 1987, pp. 41
On one approximate algorithm for solving systems of linear inequalities with boolean variables
N.N. Kuzjurin
Lecture Notes in Computer Science 278, 1987, pp. 272
Diophantine complexity
Yu. Matijasevich
Lecture Notes in Computer Science 278, 1987, pp. 301
On cartesian powers of P_2
V.A. Taimanov
Lecture Notes in Computer Science 278, 1987, pp. 435
Possibilities of probabilistic on-line counting machines
F.M. Ablayev
Lecture Notes in Computer Science 278, 1987, pp. 1-4
Functional systems on semilattices
G.P. Agibalov
Lecture Notes in Computer Science 278, 1987, pp. 5-9
Recognition of properties in K-valued logic and approximate algorithms
V.B. Alekseyev
Lecture Notes in Computer Science 278, 1987, pp. 10-13
Linearized disjunctive normal forms of boolean functions
A.A. Alexanyan
Lecture Notes in Computer Science 278, 1987, pp. 14-16
On a stable generating of random sequences by probabilistic automata
Ju.A. Alpin, B.S. Kotchkarev, R.G. Mubarakzianov
Lecture Notes in Computer Science 278, 1987, pp. 17-20
Automata classes induced by Post classes
S.V. Alyoshin
Lecture Notes in Computer Science 278, 1987, pp. 21-23
Effective lower bounds for complexity of some classes of schemes
A.E. Andreev
Lecture Notes in Computer Science 278, 1987, pp. 24-29
Stable finite automata mappings and Church-Rosser systems
A.V. Anisimov, V.A. Oleshchuk
Lecture Notes in Computer Science 278, 1987, pp. 30-33
The recursion theorem, approximations, and clasifying index sets of recursively enumerable sets
M.M. Arslanov
Lecture Notes in Computer Science 278, 1987, pp. 34-37
Duality of functions and data in algorithms description
A.D. Astakhov
Lecture Notes in Computer Science 278, 1987, pp. 38-40
Verbal operation on automaton
D.N. Babin
Lecture Notes in Computer Science 278, 1987, pp. 42-44
The new way of probabilistic compact testing
A.S. Barashko
Lecture Notes in Computer Science 278, 1987, pp. 45-47
Computational problems in alphabetic coding theory
M.Yu. Baryshev, L.P. Zhil'tzova, A.A. Markov
Lecture Notes in Computer Science 278, 1987, pp. 48-50
On the synthesis of ``irredundant'' automata from a finite set of experiments
S.A. Bogomolov
Lecture Notes in Computer Science 278, 1987, pp. 51-52
On the equivalence problem of states for cellular automata
A.A. Bolotov
Lecture Notes in Computer Science 278, 1987, pp. 53-54
Arsenals and lower bounds
L. Budach
Lecture Notes in Computer Science 278, 1987, pp. 55-64
Chain-like model of programs communication
R.G. Bukharajev, A.I. Enikeev, I.I. Makarov
Lecture Notes in Computer Science 278, 1987, pp. 65-67
Structor automata
R.G. Bukharajev, I.R. Nasirov
Lecture Notes in Computer Science 278, 1987, pp. 68-73
On A-completeness for some classes of bounded determinate functions
B.A. Buyevich
Lecture Notes in Computer Science 278, 1987, pp. 74-77
Structure synthesis of parallel programs (methodology and tools)
G.E. Cejtlin, E.L. Jushchenko
Lecture Notes in Computer Science 278, 1987, pp. 78-81
Saturating flows in networks
B.S. Chlebus, M. Chrobak, K. Diks
Lecture Notes in Computer Science 278, 1987, pp. 82-91

Seiten 1 2 3 4 5 >