Computer Science - Theory and Applications [[electronic resource] ] : Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings / / edited by Edward A. Hirsch, Alexander A. Razborov, Alexei Semenov, Anatol Slissenko |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XIII, 411 p.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Algorithms Artificial intelligence Computer science—Mathematics Bioinformatics Theory of Computation Artificial Intelligence Mathematics of Computing |
ISBN | 3-540-79709-2 |
Classificazione | 54.00 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Opening Lecture -- Randomness – A Computational Complexity Perspective -- Invited Papers -- Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds -- On Formal Equivalence Verification of Hardware -- Twelve Problems in Proof Complexity -- Manifestation and Exploitation of Invariants in Bioinformatics -- Simple Stochastic Games, Mean Payoff Games, Parity Games -- Theory Track -- Topological Semantics of Justification Logic -- A Logspace Algorithm for Partial 2-Tree Canonization -- A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics -- Computing Longest Common Substrings Via Suffix Arrays -- Logic and Rational Languages of Words Indexed by Linear Orderings -- Complexity of the Bollobás-Riordan Polynomial -- A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames -- Synchronization of Grammars -- Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates -- A Semantic Proof of Polytime Soundness of Light Affine Logic -- On Subword Complexity of Morphic Sequences -- Comparing Universal Covers in Polynomial Time -- S4LP and Local Realizability -- On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract) -- The Most General Conservation Law for a Cellular Automaton -- Lower Bounds on Frequency Estimation of Data Streams (Extended Abstract) -- From Invariants to Canonization in Parallel -- Self-referentiality of Justified Knowledge -- On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata -- Public Key Encryption and Encryption Emulation Attacks -- A Uniform Lower Bound on Weights of Perceptrons -- Lambek Grammars with One Division Are Decidable in Polynomial Time -- Cryptanalysis of Stickel’s Key Exchange Scheme -- Combinatorial Complexity of Regular Languages -- On Sequences with Non-learnable Subsequences -- Algorithms for Multiterminal Cuts -- Two Sources Are Better Than One for Increasing the Kolmogorov Complexity of Infinite Sequences -- Applications and Technology Track -- Multilayer Neuro-fuzzy Network for Short Term Electric Load Forecasting -- Invariant Generation for P-Solvable Loops with Assignments -- Using Coloured Petri Nets to Model and Verify Telecommunications Systems -- Additive Preconditioning for Matrix Computations -- Network as a Computer: Ranking Paths to Find Flows -- A Unified Categorical Approach for Attributed Graph Rewriting. |
Record Nr. | UNISA-996465328603316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Computer Science - Theory and Applications : Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings / / edited by Edward A. Hirsch, Alexander A. Razborov, Alexei Semenov, Anatol Slissenko |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XIII, 411 p.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Algorithms Artificial intelligence Computer science—Mathematics Bioinformatics Theory of Computation Artificial Intelligence Mathematics of Computing |
ISBN | 3-540-79709-2 |
Classificazione | 54.00 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Opening Lecture -- Randomness – A Computational Complexity Perspective -- Invited Papers -- Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds -- On Formal Equivalence Verification of Hardware -- Twelve Problems in Proof Complexity -- Manifestation and Exploitation of Invariants in Bioinformatics -- Simple Stochastic Games, Mean Payoff Games, Parity Games -- Theory Track -- Topological Semantics of Justification Logic -- A Logspace Algorithm for Partial 2-Tree Canonization -- A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics -- Computing Longest Common Substrings Via Suffix Arrays -- Logic and Rational Languages of Words Indexed by Linear Orderings -- Complexity of the Bollobás-Riordan Polynomial -- A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames -- Synchronization of Grammars -- Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates -- A Semantic Proof of Polytime Soundness of Light Affine Logic -- On Subword Complexity of Morphic Sequences -- Comparing Universal Covers in Polynomial Time -- S4LP and Local Realizability -- On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract) -- The Most General Conservation Law for a Cellular Automaton -- Lower Bounds on Frequency Estimation of Data Streams (Extended Abstract) -- From Invariants to Canonization in Parallel -- Self-referentiality of Justified Knowledge -- On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata -- Public Key Encryption and Encryption Emulation Attacks -- A Uniform Lower Bound on Weights of Perceptrons -- Lambek Grammars with One Division Are Decidable in Polynomial Time -- Cryptanalysis of Stickel’s Key Exchange Scheme -- Combinatorial Complexity of Regular Languages -- On Sequences with Non-learnable Subsequences -- Algorithms for Multiterminal Cuts -- Two Sources Are Better Than One for Increasing the Kolmogorov Complexity of Infinite Sequences -- Applications and Technology Track -- Multilayer Neuro-fuzzy Network for Short Term Electric Load Forecasting -- Invariant Generation for P-Solvable Loops with Assignments -- Using Coloured Petri Nets to Model and Verify Telecommunications Systems -- Additive Preconditioning for Matrix Computations -- Network as a Computer: Ranking Paths to Find Flows -- A Unified Categorical Approach for Attributed Graph Rewriting. |
Record Nr. | UNINA-9910484816103321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
The definitive guide to how computers do math [[electronic resource] ] : featuring the virtual DIY calculator / / Clive "Max" Maxfield, Alvin Brown |
Autore | Maxfield Clive <1957-> |
Pubbl/distr/stampa | Hoboken, N.J., : Wiley-Interscience, c2005 |
Descrizione fisica | 1 online resource (469 p.) |
Disciplina |
004.0151
004/.01/51 |
Altri autori (Persone) | BrownAlvin <1954-> |
Soggetto topico | Computer science - Mathematics |
Soggetto genere / forma | Electronic books. |
ISBN |
1-280-23573-X
9786610235735 0-470-36237-5 0-471-74196-5 0-471-74197-3 |
Classificazione | 54.00 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | How Computers Do Math; Contents; Laboratories; Do You Speak Martian?; Chapter 0 Why This Book Is So Cool; Chapter 1 Introducing Binary and Hexadecimal Numbers; Chapter 2 Computers and Calculators; Chapter 3 Subroutines and Other Stuff; Chapter 4 Integer Arithmetic; Chapter 5 Creating an Integer Calculator; Chapter 6 More Functions and Experiments; Interactive Laboratories; Appendix A Installing Your DIY Calculator; Appendix B Addressing Modes; Appendix C Instruction Set Summary; Appendix D Additional Resources; About the Authors; Acknowledgments; Index |
Record Nr. | UNINA-9910144256803321 |
Maxfield Clive <1957->
![]() |
||
Hoboken, N.J., : Wiley-Interscience, c2005 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
The definitive guide to how computers do math [[electronic resource] ] : featuring the virtual DIY calculator / / Clive "Max" Maxfield, Alvin Brown |
Autore | Maxfield Clive <1957-> |
Pubbl/distr/stampa | Hoboken, N.J., : Wiley-Interscience, c2005 |
Descrizione fisica | 1 online resource (469 p.) |
Disciplina |
004.0151
004/.01/51 |
Altri autori (Persone) | BrownAlvin <1954-> |
Soggetto topico | Computer science - Mathematics |
ISBN |
1-280-23573-X
9786610235735 0-470-36237-5 0-471-74196-5 0-471-74197-3 |
Classificazione | 54.00 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | How Computers Do Math; Contents; Laboratories; Do You Speak Martian?; Chapter 0 Why This Book Is So Cool; Chapter 1 Introducing Binary and Hexadecimal Numbers; Chapter 2 Computers and Calculators; Chapter 3 Subroutines and Other Stuff; Chapter 4 Integer Arithmetic; Chapter 5 Creating an Integer Calculator; Chapter 6 More Functions and Experiments; Interactive Laboratories; Appendix A Installing Your DIY Calculator; Appendix B Addressing Modes; Appendix C Instruction Set Summary; Appendix D Additional Resources; About the Authors; Acknowledgments; Index |
Record Nr. | UNINA-9910830765403321 |
Maxfield Clive <1957->
![]() |
||
Hoboken, N.J., : Wiley-Interscience, c2005 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
The definitive guide to how computers do math : featuring the virtual DIY calculator / / Clive "Max" Maxfield, Alvin Brown |
Autore | Maxfield Clive <1957-> |
Pubbl/distr/stampa | Hoboken, N.J., : Wiley-Interscience, c2005 |
Descrizione fisica | 1 online resource (469 p.) |
Disciplina | 004/.01/51 |
Altri autori (Persone) | BrownAlvin <1954-> |
Soggetto topico | Computer science - Mathematics |
ISBN |
1-280-23573-X
9786610235735 0-470-36237-5 0-471-74196-5 0-471-74197-3 |
Classificazione | 54.00 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | How Computers Do Math; Contents; Laboratories; Do You Speak Martian?; Chapter 0 Why This Book Is So Cool; Chapter 1 Introducing Binary and Hexadecimal Numbers; Chapter 2 Computers and Calculators; Chapter 3 Subroutines and Other Stuff; Chapter 4 Integer Arithmetic; Chapter 5 Creating an Integer Calculator; Chapter 6 More Functions and Experiments; Interactive Laboratories; Appendix A Installing Your DIY Calculator; Appendix B Addressing Modes; Appendix C Instruction Set Summary; Appendix D Additional Resources; About the Authors; Acknowledgments; Index |
Altri titoli varianti | How computers do math |
Record Nr. | UNINA-9910877411603321 |
Maxfield Clive <1957->
![]() |
||
Hoboken, N.J., : Wiley-Interscience, c2005 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Proceedings / / the Computer Security Foundations Workshop |
Pubbl/distr/stampa | Washington [D.C.] : , : IEEE Computer Society Press, , 1988-1996 |
Disciplina | 005.8 |
Soggetto topico | Computer security |
Soggetto genere / forma | Periodicals. |
ISSN | 2377-5459 |
Classificazione | 54.00 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Periodico |
Lingua di pubblicazione | eng |
Altri titoli varianti | Proceedings of the ... IEEE Computer Security Foundations Workshop |
Record Nr. | UNINA-9910626149103321 |
Washington [D.C.] : , : IEEE Computer Society Press, , 1988-1996 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Proceedings / / the Computer Security Foundations Workshop |
Pubbl/distr/stampa | Washington [D.C.] : , : IEEE Computer Society Press, , 1988-1996 |
Disciplina | 005.8 |
Soggetto topico | Computer security |
Soggetto genere / forma | Periodicals. |
ISSN | 2377-5459 |
Classificazione | 54.00 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Periodico |
Lingua di pubblicazione | eng |
Altri titoli varianti | Proceedings of the ... IEEE Computer Security Foundations Workshop |
Record Nr. | UNISA-996280775503316 |
Washington [D.C.] : , : IEEE Computer Society Press, , 1988-1996 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|