Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Aspects and Prospects of Theoretical Computer Science [[electronic resource] ] : 6th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November 19-23, 1990. Proceedings / / edited by Jürgen Dassow, Jozef Kelemen
| Aspects and Prospects of Theoretical Computer Science [[electronic resource] ] : 6th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November 19-23, 1990. Proceedings / / edited by Jürgen Dassow, Jozef Kelemen |
| Edizione | [1st ed. 1990.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
| Descrizione fisica | 1 online resource (XIII, 299 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Theory of Computation |
| ISBN | 3-540-46869-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Methods for generating deterministic fractals and image compression -- Optimum simulation of meshes by small hypercubes -- Seven hard problems in symbolic background knowledge acquisition -- Subsequential functions: Characterizations, minimization, examples -- Past proves more invariance properties but not pca's -- Complexity issues in discrete neurocomputing -- Two-way reading on words -- Proofs and reachability problem for ground rewrite systems -- Problems complete for ?L -- Constructive matching — Explanation based methodology for inductive theorem proving -- Characterizing complexity classes by higher type -- The distributed termination problem : Formal solution and correctness based on petri nets -- Greedy compression systems -- A DIV(N) depth Boolean circuit for smooth modular inverse -- Learning by conjugate gradients -- Monoids described by pushdown automata -- Optimal parallel 3-colouring algorithm for rooted trees and its application -- Hierarchies over the context-free languages -- A hierarchy of unary primitive recursive string-functions -- Minimizing picture words -- Remarks on the frequency-coded neural nets complexity -- Picture generation using matrix systems -- Representing heuristic-relevant information for an automated theorem prover -- A new method for proving lower bounds in the model of algebraic decision trees -- Area time squared and area complexity of VLSI computations is strongly unclosed under union and intersection -- Decision procedure for checking validity of PAL formulas. |
| Record Nr. | UNISA-996465588403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Machines, Languages, and Complexity [[electronic resource] ] : 5th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November 14-18, 1988. Selected Contributions / / edited by Jürgen Dassow, Jozef Kelemen
| Machines, Languages, and Complexity [[electronic resource] ] : 5th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November 14-18, 1988. Selected Contributions / / edited by Jürgen Dassow, Jozef Kelemen |
| Edizione | [1st ed. 1989.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 |
| Descrizione fisica | 1 online resource (VIII, 248 p.) |
| Disciplina | 621.39 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer engineering
Computers Mathematical logic Artificial intelligence Computer Engineering Computation by Abstract Devices Mathematical Logic and Formal Languages Artificial Intelligence |
| ISBN | 3-540-48203-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Questions of decidability for context-free chain code picture languages -- Chomsky hierarchy and communication complexity -- Complexity theory and formal languages -- Rational cones and commutations -- A remark on some classifications of Indian parallel languages -- An extension of the Krohn-Rhodes decomposition of automata -- A survey of two-dimensional automata theory -- The simulation of two-dimensional one-marker automata by three-way turing machines -- Some properties of space-bounded synchronized alternating turing machines with only universal states -- The virtual floating grid file -- A partially persistent data structure for the set-union problem with backtracking -- A note on the computational complexity of bracketing and related problems -- Postorder hierarchy for path compressions and set union -- The convex hull problem on grids computational and combinatorial aspects -- The riches of rectangles -- The limitations of partial evaluation -- Algorithmic learning from incomplete information: Principles and problems -- A cryptosystem based on propositional logic -- Tutorial: Cryptography and data security. |
| Record Nr. | UNISA-996465727003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||