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.
CSL'88 [[electronic resource] ] : 2nd Workshop on Computer Science Logic, Duisburg, FRG, October 3-7, 1988. Proceedings / / edited by Egon Börger, Hans Kleine Büning, Michael M. Richter
| CSL'88 [[electronic resource] ] : 2nd Workshop on Computer Science Logic, Duisburg, FRG, October 3-7, 1988. Proceedings / / edited by Egon Börger, Hans Kleine Büning, Michael M. Richter |
| Edizione | [1st ed. 1989.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 |
| Descrizione fisica | 1 online resource (VIII, 404 p.) |
| Disciplina | 003.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Architecture, Computer
Mathematical logic Programming languages (Electronic computers) Computer logic Combinatorics Computer System Implementation Mathematical Logic and Foundations Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-46736-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On disjunctive self-reducibility -- The knowledge representation language LLILOG -- Completeness with respect to interpretations in deterministic and nondeterministic polynomial time -- A temporal logic approach to specify and to prove properties of finite state concurrent systems -- A comparison of the resolution calculus and the connection method, and a new calculus generalizing both methods -- Characterizing complexity classes by general recursive definitions in higher types -- Size of models versus length of computations -- Boolean circuit complexity of algebraic interpolation problems -- Loop detection in propositional Prolog programs -- Numberings of R1?F -- Interval temporal logic and star-free expressions -- An interpreter with lazy evaluation for Prolog with functions -- On the complexity of the decision problem in propositional nonmonotonic logic -- Gentzen-Systems for propositional temporal logics -- Predicate inequalities as a basis for automated termination proofs for Prolog programs -- On the existence of fair schedulers -- Using finite-linear temporal logic for specifying database dynamics -- Is average superlinear speedup possible? -- Enforcement of integrity constraints in a semantic data model -- Delete operations and Horn formulas -- Integration of descriptive and procedural language constructs -- Normal forms and the complexity of computations of logic programs -- A remark on minimal polynomials of Boolean functions -- On the emptiness problem of tree automata and completeness of modal logics of programs. |
| Record Nr. | UNISA-996465728803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Cylindric-like Algebras and Algebraic Logic [[electronic resource] /] / edited by Hajnal Andréka, Miklós Ferenczi, István Németi
| Cylindric-like Algebras and Algebraic Logic [[electronic resource] /] / edited by Hajnal Andréka, Miklós Ferenczi, István Németi |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (457 p.) |
| Disciplina | 511.32 |
| Collana | Bolyai Society Mathematical Studies |
| Soggetto topico |
Mathematical logic
Algebra Combinatorics Mathematical Logic and Foundations Mathematical Logic and Formal Languages |
| ISBN | 3-642-35025-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- H. Andréka and I. Németi: Reducing First-order Logic to Df3, Free Algebras -- N.Bezhanishvili: Varieties of Two-Dimensional Cylindric Algebras -- R. Hirsch and I. Hodkinson: Completions and Complete Representations -- J. Madarász and T. Sayed Ahmed: Amalgamation, Interpolation and Epimorphisms in Algebraic Logic -- T. Sayed Ahmed: Neat Reducts and Neat Embeddings in Cylindric Algebras -- M. Ferenczi: A New Representation Theory: Representing Cylindric-like Algebras by Relativized Set Algebras -- A. Simon: Representing all Cylindric Algebras by Twisting, On a Problem of Henkin -- A. Kurucz: Representable Cylindric Algebras and Many-Dimensional Modal Logics -- T. Sayed Ahmed: Completions, Complete Representations and Omitting Types -- G. Serény: Elements of Cylindric Algebraic Model Theory -- Y. Venema: Cylindric Modal Logic -- J. van Benthem: Crs and Guarded Logics: A Fruitful Contact -- R. S. Dordevic and M. D. Raskovic: Cylindric Probability Algebras.-I. Duentsch: Cylindric Algebras and Relational Databases. – M. Ferenczi: Probability Measures and Measurable Functions on Cylindric Algebras. – A. Mann: Cylindric Set Algebras and IF Logic. – G. Sági: Polyadic Algebras. – I. Sain: Definability Issues in Universal Logic. – Bibliography. - Index. |
| Record Nr. | UNINA-9910438138403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Decompositions of graphs / Juraj Bosak ; transl. Jozef Siran, Martin Skoviera
| Decompositions of graphs / Juraj Bosak ; transl. Jozef Siran, Martin Skoviera |
| Autore | Bosak, Juraj |
| Edizione | [1st Engl. ed] |
| Pubbl/distr/stampa | Dordrecht : Kluwer Academic Publishers, 1990 |
| Descrizione fisica | xviii, 248 p. ; 24 cm. |
| Disciplina | 511.5 |
| Altri autori (Persone) |
Siran, Jozef
Skoviera, Martin |
| Collana | Mathematics and its applications. East european series ; 47 |
| Soggetto topico |
Combinatorics
Graph theory |
| ISBN | 079230747X |
| Classificazione |
AMS 05-02
AMS 05-XX AMS 05C |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991000806949707536 |
Bosak, Juraj
|
||
| Dordrecht : Kluwer Academic Publishers, 1990 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
The Design of an Extendible Graph Editor [[electronic resource] /] / by Frances N. Paulisch
| The Design of an Extendible Graph Editor [[electronic resource] /] / by Frances N. Paulisch |
| Autore | Paulisch Frances N |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (XVI, 196 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Application software
Software engineering Computer graphics Computer programming Combinatorics Computer Applications Software Engineering Computer Graphics Programming Techniques |
| ISBN | 3-540-47898-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Definition of terms -- Related work: Graph editors -- Layout algorithms and layout constraints -- Graphical abstraction -- Persistence -- Extendibility -- EDGE: An extendible graph editor -- Summary and future research -- Conclusion. |
| Record Nr. | UNISA-996466152303316 |
|
Paulisch Frances N
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Design of Hashing Algorithms [[electronic resource] /] / by Josef Pieprzyk, Babak Sadeghiyan
| Design of Hashing Algorithms [[electronic resource] /] / by Josef Pieprzyk, Babak Sadeghiyan |
| Autore | Pieprzyk Josef |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (XV, 196 p.) |
| Disciplina | 005.8/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Data encryption (Computer science) Coding theory Information theory Combinatorics Algorithms Operating systems (Computers) Data Structures Cryptology Coding and Information Theory Algorithm Analysis and Problem Complexity Operating Systems |
| ISBN | 3-540-48198-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Overview of hash functions -- Methods of attack on hash functions -- Pseudorandomness -- Construction of super-pseudorandom permutations -- A sound structure -- A construction for one way hash functions and pseudorandom bit generators -- How to construct a family of strong one-way permutations -- Conclusions. |
| Record Nr. | UNISA-996466067303316 |
|
Pieprzyk Josef
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Design theory / Thomas Beth, Dieter Jungnickel, Hanfried Lenz
| Design theory / Thomas Beth, Dieter Jungnickel, Hanfried Lenz |
| Autore | Beth, Thomas |
| Pubbl/distr/stampa | Cambridge : Cambridge University Press, 1986 |
| Descrizione fisica | 688 p. ; 23 cm |
| Disciplina | 516.1 |
| Altri autori (Persone) | Jungnickel, Dieterauthor |
| Collana | Encyclopedia of mathematics and its applications ; 69 |
| Soggetto topico |
Combinatorics
Design theory |
| ISBN | 0521333342 |
| Classificazione |
AMS 05-01
AMS 05B |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991000810879707536 |
|
Beth, Thomas
|
||
| Cambridge : Cambridge University Press, 1986 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
The development of the number field sieve [e-book] / edited by Arjen K. Lenstra, Hendrik W. Lenstra
| The development of the number field sieve [e-book] / edited by Arjen K. Lenstra, Hendrik W. Lenstra |
| Pubbl/distr/stampa | Berlin : Springer, 1993 |
| Descrizione fisica | 1 online resource (viii, 140 p.) |
| Disciplina | 512.7 |
| Altri autori (Persone) |
Lenstra, Arjen K.
Lenstra, Hendrik W. |
| Collana | Lecture Notes in Mathematics, 0075-8434 ; 1554 |
| Soggetto topico |
Mathematics
Combinatorics Number theory |
| ISBN | 9783540478928 |
| Classificazione |
AMS 11-XX
AMS 11Y05 AMS 11Y40 |
| Formato | Risorse elettroniche  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991002243969707536 |
| Berlin : Springer, 1993 | ||
| Risorse elettroniche | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Digraphs [e-book] : theory, algorithms and applications / by Jørgen Bang-Jensen, Gregory Z. Gutin
| Digraphs [e-book] : theory, algorithms and applications / by Jørgen Bang-Jensen, Gregory Z. Gutin |
| Autore | Bang-Jensen, Jørgen |
| Pubbl/distr/stampa | London : Springer, 2009 |
| Descrizione fisica | v.: digital |
| Altri autori (Persone) | Gutin, Gregory Z. |
| Collana | Springer monographs in mathematics, 1439-7382 |
| Soggetto topico |
Computer software
Algorithms Combinatorics Mathematical optimization |
| ISBN | 9781848009981 |
| Formato | Software  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991001285379707536 |
|
Bang-Jensen, Jørgen
|
||
| London : Springer, 2009 | ||
| Software | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Discrete and Computational Geometry [[electronic resource] ] : Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers / / edited by Jin Akiyama, Mikio Kano, Masatsugu Urabe
| Discrete and Computational Geometry [[electronic resource] ] : Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers / / edited by Jin Akiyama, Mikio Kano, Masatsugu Urabe |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (VIII, 340 p.) |
| Disciplina | 516/.13 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Geometry
Computers Computer graphics Algorithms Computer science—Mathematics Combinatorics Theory of Computation Computer Graphics Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science |
| ISBN | 3-540-46515-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Papers -- Radial Perfect Partitions of Convex Sets in the Plane -- Dudeney Dissection of Polygons -- Effective Use of Geometric Properties for Clustering -- Living with lrs -- On the Existente of a Point Subset with 4 or 5 Interior Points -- Planar Drawing Algorithms of Survivable Telecommunication Networks -- Polygon Cutting: Revisited -- Algorithms for Packing Two Circles in a Convex Polygon -- Folding and Cutting Paper -- An Interpolant Based on Line Segment Voronoi Diagrams -- 2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces -- NP-Completeness of Stage Illumination Problems -- On the Maximum Degree of Bipartite Embeddings of Trees in the Plane -- Efficient Regular Polygon Dissections -- On Soddy’s Hexlet and a Linked 4-Pair -- Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs -- Visibility of Disks on the Lattice Points -- Convex Hull Problem with Imprecise Input -- One-Dimensional Tilings with Congruent Copies of a 3-Point Set -- Polygonal Approximations for Curved Problems: An Application to Arrangements -- Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms -- Folding and Unfolding in Computational Geometry -- Crossing Numbers -- A Note on the Existente of Plane Spanning Trees of Geometrie Graphs -- Embeddings of Equilateral Polygons in Unit Lattices -- Order-k Voronoi Diagrams, k-Sections, and k-Sets -- ”Impossible Objects” Are Not Necessarily Impossible – Mathematical Study on Optical Illusion – -- An Efficient Solution to the Corridor Search Problem. |
| Record Nr. | UNINA-9910143638503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Discrete and Computational Geometry [[electronic resource] ] : Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers / / edited by Jin Akiyama, Mikio Kano, Masatsugu Urabe
| Discrete and Computational Geometry [[electronic resource] ] : Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers / / edited by Jin Akiyama, Mikio Kano, Masatsugu Urabe |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (VIII, 340 p.) |
| Disciplina | 516/.13 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Geometry
Computers Computer graphics Algorithms Computer science—Mathematics Combinatorics Theory of Computation Computer Graphics Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science |
| ISBN | 3-540-46515-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Papers -- Radial Perfect Partitions of Convex Sets in the Plane -- Dudeney Dissection of Polygons -- Effective Use of Geometric Properties for Clustering -- Living with lrs -- On the Existente of a Point Subset with 4 or 5 Interior Points -- Planar Drawing Algorithms of Survivable Telecommunication Networks -- Polygon Cutting: Revisited -- Algorithms for Packing Two Circles in a Convex Polygon -- Folding and Cutting Paper -- An Interpolant Based on Line Segment Voronoi Diagrams -- 2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces -- NP-Completeness of Stage Illumination Problems -- On the Maximum Degree of Bipartite Embeddings of Trees in the Plane -- Efficient Regular Polygon Dissections -- On Soddy’s Hexlet and a Linked 4-Pair -- Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs -- Visibility of Disks on the Lattice Points -- Convex Hull Problem with Imprecise Input -- One-Dimensional Tilings with Congruent Copies of a 3-Point Set -- Polygonal Approximations for Curved Problems: An Application to Arrangements -- Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms -- Folding and Unfolding in Computational Geometry -- Crossing Numbers -- A Note on the Existente of Plane Spanning Trees of Geometrie Graphs -- Embeddings of Equilateral Polygons in Unit Lattices -- Order-k Voronoi Diagrams, k-Sections, and k-Sets -- ”Impossible Objects” Are Not Necessarily Impossible – Mathematical Study on Optical Illusion – -- An Efficient Solution to the Corridor Search Problem. |
| Record Nr. | UNISA-996465585203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Soggetto topico
-
Combinatorics
(447)
- Algorithms (127)
- Algorithm Analysis and Problem Complexity (105)
- Computers (98)
- Theory of Computation (79)