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.
Alan Turing : his work and impact / / edited by S. Barry Cooper and Jan van Leeuwen
| Alan Turing : his work and impact / / edited by S. Barry Cooper and Jan van Leeuwen |
| Autore | Cooper S. B (S. Barry) |
| Pubbl/distr/stampa | Amsterdam ; ; Boston, : Elsevier, 2013 |
| Descrizione fisica | 1 online resource (xxi, 914 pages) : illustrations (some color) |
| Disciplina |
510.92
B |
| Collana | Gale eBooks |
| Soggetto topico |
Mathematicians - Great Britain
Computer science - Mathematics Enigma cipher system Logic, Symbolic and mathematical |
| ISBN |
1-299-38603-2
0-12-387012-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | pt. 1. How do we compute? what can we prove? -- pt. 2. Hiding and unhiding information : cryptology, complexity and number theory -- pt. 3. Building a brain : intelligent machines, practice and theory -- pt. 4. The mathematics of emergence : the mysteries of morphogenesis. |
| Record Nr. | UNINA-9910779414203321 |
Cooper S. B (S. Barry)
|
||
| Amsterdam ; ; Boston, : Elsevier, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Alan Turing : his work and impact / / edited by S. Barry Cooper and Jan van Leeuwen
| Alan Turing : his work and impact / / edited by S. Barry Cooper and Jan van Leeuwen |
| Autore | Cooper S. B (S. Barry) |
| Pubbl/distr/stampa | Amsterdam ; ; Boston, : Elsevier, 2013 |
| Descrizione fisica | 1 online resource (xxi, 914 pages) : illustrations (some color) |
| Disciplina |
510.92
B |
| Collana | Gale eBooks |
| Soggetto topico |
Mathematicians - Great Britain
Computer science - Mathematics Enigma cipher system Logic, Symbolic and mathematical |
| ISBN |
1-299-38603-2
0-12-387012-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | pt. 1. How do we compute? what can we prove? -- pt. 2. Hiding and unhiding information : cryptology, complexity and number theory -- pt. 3. Building a brain : intelligent machines, practice and theory -- pt. 4. The mathematics of emergence : the mysteries of morphogenesis. |
| Record Nr. | UNINA-9910823942503321 |
|
Cooper S. B (S. Barry)
|
||
| Amsterdam ; ; Boston, : Elsevier, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Alan Turing [[electronic resource] ] : his work and impact / / edited by S. Barry Cooper and J. van Leeuwen
| Alan Turing [[electronic resource] ] : his work and impact / / edited by S. Barry Cooper and J. van Leeuwen |
| Pubbl/distr/stampa | Amsterdam ; ; Boston, : Elsevier, 2013 |
| Descrizione fisica | 1 online resource (937 p.) |
| Disciplina |
510.92
B |
| Altri autori (Persone) |
CooperS. B (S. Barry)
LeeuwenJ. van (Jan) |
| Soggetto topico |
Mathematicians - Great Britain
Computer science - Mathematics Enigma cipher system Logic, Symbolic and mathematical |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-299-38603-2
0-12-387012-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | pt. 1. How do we compute? what can we prove? -- pt. 2. Hiding and unhiding information : cryptology, complexity and number theory -- pt. 3. Building a brain : intelligent machines, practice and theory -- pt. 4. The mathematics of emergence : the mysteries of morphogenesis. |
| Record Nr. | UNINA-9910452723403321 |
| Amsterdam ; ; Boston, : Elsevier, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computability in context [[electronic resource] ] : computation and logic in the real world / / editors, S. Barry Cooper, Andrea Sorbi
| Computability in context [[electronic resource] ] : computation and logic in the real world / / editors, S. Barry Cooper, Andrea Sorbi |
| Pubbl/distr/stampa | London, : Imperial College Press |
| Descrizione fisica | 1 online resource (419 p.) |
| Disciplina | 511.3/52 |
| Altri autori (Persone) |
CooperS. B (S. Barry)
SorbiAndrea <1956-> |
| Soggetto topico |
Computable functions
Computational intelligence Set theory Mathematics - Philosophy |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-283-14816-1
9786613148162 1-84816-277-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Contents; 1. Computation, Information, and the Arrow of Time P. Adriaans & P. van Emde Boas; 2. The Isomorphism Conjecture for NP M. Agrawal; 3. The Ershov Hierarchy M. M. Arslanov; 4. Complexity and Approximation in Reoptimization G. Ausiello, V. Bonifaci, & B. Escoffer; 5. Definability in the Real Universe S. B. Cooper; 6. HF-Computability Y. L. Ershov, V. G. Puzarenko, & A. I. Stukachev; 7. The Mathematics of Computing between Logic and Physics G. Longo & T. Paul; 8. Liquid State Machines: Motivation, Theory, and Applications W. Maass
9. Experiments on an Internal Approach to Typed Algorithms in Analysis D. Normann10. Recursive Functions: An Archeological Look P. Odifreddi; 11. Reverse Mathematics and Well-ordering Principles M. Rathjen & A. Weiermann; 12. Discrete Transfinite Computation Models P. D. Welch |
| Record Nr. | UNINA-9910461306003321 |
| London, : Imperial College Press | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computability in context [[electronic resource] ] : computation and logic in the real world / / editors, S. Barry Cooper, Andrea Sorbi
| Computability in context [[electronic resource] ] : computation and logic in the real world / / editors, S. Barry Cooper, Andrea Sorbi |
| Pubbl/distr/stampa | London, : Imperial College Press |
| Descrizione fisica | 1 online resource (419 p.) |
| Disciplina | 511.3/52 |
| Altri autori (Persone) |
CooperS. B (S. Barry)
SorbiAndrea <1956-> |
| Soggetto topico |
Computable functions
Computational intelligence Set theory Mathematics - Philosophy |
| ISBN |
1-283-14816-1
9786613148162 1-84816-277-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Contents; 1. Computation, Information, and the Arrow of Time P. Adriaans & P. van Emde Boas; 2. The Isomorphism Conjecture for NP M. Agrawal; 3. The Ershov Hierarchy M. M. Arslanov; 4. Complexity and Approximation in Reoptimization G. Ausiello, V. Bonifaci, & B. Escoffer; 5. Definability in the Real Universe S. B. Cooper; 6. HF-Computability Y. L. Ershov, V. G. Puzarenko, & A. I. Stukachev; 7. The Mathematics of Computing between Logic and Physics G. Longo & T. Paul; 8. Liquid State Machines: Motivation, Theory, and Applications W. Maass
9. Experiments on an Internal Approach to Typed Algorithms in Analysis D. Normann10. Recursive Functions: An Archeological Look P. Odifreddi; 11. Reverse Mathematics and Well-ordering Principles M. Rathjen & A. Weiermann; 12. Discrete Transfinite Computation Models P. D. Welch |
| Record Nr. | UNINA-9910789411903321 |
| London, : Imperial College Press | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computability in context [[electronic resource] ] : computation and logic in the real world / / editors, S. Barry Cooper, Andrea Sorbi
| Computability in context [[electronic resource] ] : computation and logic in the real world / / editors, S. Barry Cooper, Andrea Sorbi |
| Pubbl/distr/stampa | London, : Imperial College Press |
| Descrizione fisica | 1 online resource (419 p.) |
| Disciplina | 511.3/52 |
| Altri autori (Persone) |
CooperS. B (S. Barry)
SorbiAndrea <1956-> |
| Soggetto topico |
Computable functions
Computational intelligence Set theory Mathematics - Philosophy |
| ISBN |
1-283-14816-1
9786613148162 1-84816-277-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Contents; 1. Computation, Information, and the Arrow of Time P. Adriaans & P. van Emde Boas; 2. The Isomorphism Conjecture for NP M. Agrawal; 3. The Ershov Hierarchy M. M. Arslanov; 4. Complexity and Approximation in Reoptimization G. Ausiello, V. Bonifaci, & B. Escoffer; 5. Definability in the Real Universe S. B. Cooper; 6. HF-Computability Y. L. Ershov, V. G. Puzarenko, & A. I. Stukachev; 7. The Mathematics of Computing between Logic and Physics G. Longo & T. Paul; 8. Liquid State Machines: Motivation, Theory, and Applications W. Maass
9. Experiments on an Internal Approach to Typed Algorithms in Analysis D. Normann10. Recursive Functions: An Archeological Look P. Odifreddi; 11. Reverse Mathematics and Well-ordering Principles M. Rathjen & A. Weiermann; 12. Discrete Transfinite Computation Models P. D. Welch |
| Record Nr. | UNINA-9910820400803321 |
| London, : Imperial College Press | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computation and Logic in the Real World [[electronic resource] ] : Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings / / edited by Barry S. Cooper, Benedikt Löwe, Andrea Sorbi
| Computation and Logic in the Real World [[electronic resource] ] : Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings / / edited by Barry S. Cooper, Benedikt Löwe, Andrea Sorbi |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XVIII, 826 p.) |
| Disciplina | 511.352 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Artificial intelligence Bioinformatics Theory of Computation Mathematics of Computing Artificial Intelligence |
| ISBN | 3-540-73001-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Shifting and Lifting of Cellular Automata -- Learning as Data Compression -- Reachability Problems: An Update -- RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice -- Producer/Consumer in Membrane Systems and Petri Nets -- A Minimal Pair in the Quotient Structure M/NCup -- Constructive Dimension and Weak Truth-Table Degrees -- A Classification of Viruses Through Recursion Theorems -- Borel Complexity of Topological Operations on Computable Metric Spaces -- Colocatedness and Lebesgue Integrability -- Computing with Genetic Gates -- Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems -- Characterizing Programming Systems Allowing Program Self-reference -- K-Trivial Closed Sets and Continuous Functions -- Pseudojump Operators and Classes -- Sofic Trace Subshift of a Cellular Automaton -- Thin Maximal Antichains in the Turing Degrees -- Effective Computation for Nonlinear Systems -- On Rules and Parameter Free Systems in Bounded Arithmetic -- The New Promise of Analog Computation -- Comparing C.E. Sets Based on Their Settling Times -- Time-Complexity Semantics for Feasible Affine Recursions -- Algebraic Model of an Arithmetic Unit for TTE-Computable Normalized Rational Numbers -- Feasible Depth -- Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model -- A Continuous Derivative for Real-Valued Functions -- Refocusing Generalised Normalisation -- The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number -- Parameterized Complexity and Logic -- Index Sets of Computable Structures with Decidable Theories -- Minimal Representations for Majority Games -- Linear Transformations in Boolean Complexity Theory -- Exact Pair Theorem for the ?-Enumeration Degrees -- Operational Semantics for Positive Relevant Logics Without Distribution -- Multi-valued Logics, Effectiveness and Domains -- Internal Computability -- Post’s Problem for Ordinal Register Machines -- Unique Existence and Computability in Constructive Reverse Mathematics -- Input-Dependence in Function-Learning -- Some Notes on Degree Spectra of the Structures -- Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus -- The Polynomial and Linear Hierarchies in V0 -- The Uniformity Principle for ?-Definability with Applications to Computable Analysis -- Circuit Complexity of Regular Languages -- Definability in the Homomorphic Quasiorder of Finite Labeled Forests -- Physics and Computation: The Status of Landauer’s Principle -- Strict Self-assembly of Discrete Sierpinski Triangles -- Binary Trees and (Maximal) Order Types -- A Weakly 2-Random Set That Is Not Generalized Low -- Speed-Up Theorems in Type-2 Computation -- The Complexity of Quickly ORM-Decidable Sets -- On Accepting Networks of Splicing Processors of Size 3 -- Liquid Computing -- Quotients over Minimal Type Theory -- Hairpin Completion Versus Hairpin Reduction -- Hierarchies in Fragments of Monadic Strict NP -- Membrane Systems and Their Application to Systems Biology -- Some Aspects of a Complexity Theory for Continuous Time Systems -- Enumerations and Torsion Free Abelian Groups -- Locally Computable Structures -- Logic and Control -- Nash Stability in Additively Separable Hedonic Games Is NP-Hard -- Comparing Notions of Computational Entropy -- From Logic to Physics: How the Meaning of Computation Changed over Time -- Theories and Ordinals: Ordinal Analysis -- Computable Riemann Surfaces -- Rank Lower Bounds for the Sherali-Adams Operator -- Infinite Computations and a Hierarchy in ? 3 -- Natural Computing: A Natural and Timely Trend for Natural Sciences and Science of Computation -- Biochemical Reactions as Computations -- Doing Without Turing Machines: Constructivism and Formal Topology -- Problems as Solutions -- A Useful Undecidable Theory -- On the Computational Power of Flip-Flop Proteins on Membranes -- Computability and Incomputability -- A Jump Inversion Theorem for the Degree Spectra -- Cupping Enumeration Degrees to 0 e ? -- What Is the Lesson of Quantum Computing? -- Does the Cell Compute? -- Computational Complexity of Constraint Satisfaction -- Finding Most Likely Solutions -- Turing Unbound: Transfinite Computation -- Computability in Amorphous Structures -- The Complexity of Small Universal Turing Machines -- Approximating Generalized Multicut on Trees -- (Short) Survey of Real Hypercomputation -- Characterizing Programming Systems Allowing Program Self-reference. |
| Record Nr. | UNISA-996466108003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computation and Logic in the Real World [[electronic resource] ] : Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings / / edited by Barry S. Cooper, Benedikt Löwe, Andrea Sorbi
| Computation and Logic in the Real World [[electronic resource] ] : Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings / / edited by Barry S. Cooper, Benedikt Löwe, Andrea Sorbi |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XVIII, 826 p.) |
| Disciplina | 511.352 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Artificial intelligence Bioinformatics Theory of Computation Mathematics of Computing Artificial Intelligence |
| ISBN | 3-540-73001-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Shifting and Lifting of Cellular Automata -- Learning as Data Compression -- Reachability Problems: An Update -- RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice -- Producer/Consumer in Membrane Systems and Petri Nets -- A Minimal Pair in the Quotient Structure M/NCup -- Constructive Dimension and Weak Truth-Table Degrees -- A Classification of Viruses Through Recursion Theorems -- Borel Complexity of Topological Operations on Computable Metric Spaces -- Colocatedness and Lebesgue Integrability -- Computing with Genetic Gates -- Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems -- Characterizing Programming Systems Allowing Program Self-reference -- K-Trivial Closed Sets and Continuous Functions -- Pseudojump Operators and Classes -- Sofic Trace Subshift of a Cellular Automaton -- Thin Maximal Antichains in the Turing Degrees -- Effective Computation for Nonlinear Systems -- On Rules and Parameter Free Systems in Bounded Arithmetic -- The New Promise of Analog Computation -- Comparing C.E. Sets Based on Their Settling Times -- Time-Complexity Semantics for Feasible Affine Recursions -- Algebraic Model of an Arithmetic Unit for TTE-Computable Normalized Rational Numbers -- Feasible Depth -- Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model -- A Continuous Derivative for Real-Valued Functions -- Refocusing Generalised Normalisation -- The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number -- Parameterized Complexity and Logic -- Index Sets of Computable Structures with Decidable Theories -- Minimal Representations for Majority Games -- Linear Transformations in Boolean Complexity Theory -- Exact Pair Theorem for the ?-Enumeration Degrees -- Operational Semantics for Positive Relevant Logics Without Distribution -- Multi-valued Logics, Effectiveness and Domains -- Internal Computability -- Post’s Problem for Ordinal Register Machines -- Unique Existence and Computability in Constructive Reverse Mathematics -- Input-Dependence in Function-Learning -- Some Notes on Degree Spectra of the Structures -- Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus -- The Polynomial and Linear Hierarchies in V0 -- The Uniformity Principle for ?-Definability with Applications to Computable Analysis -- Circuit Complexity of Regular Languages -- Definability in the Homomorphic Quasiorder of Finite Labeled Forests -- Physics and Computation: The Status of Landauer’s Principle -- Strict Self-assembly of Discrete Sierpinski Triangles -- Binary Trees and (Maximal) Order Types -- A Weakly 2-Random Set That Is Not Generalized Low -- Speed-Up Theorems in Type-2 Computation -- The Complexity of Quickly ORM-Decidable Sets -- On Accepting Networks of Splicing Processors of Size 3 -- Liquid Computing -- Quotients over Minimal Type Theory -- Hairpin Completion Versus Hairpin Reduction -- Hierarchies in Fragments of Monadic Strict NP -- Membrane Systems and Their Application to Systems Biology -- Some Aspects of a Complexity Theory for Continuous Time Systems -- Enumerations and Torsion Free Abelian Groups -- Locally Computable Structures -- Logic and Control -- Nash Stability in Additively Separable Hedonic Games Is NP-Hard -- Comparing Notions of Computational Entropy -- From Logic to Physics: How the Meaning of Computation Changed over Time -- Theories and Ordinals: Ordinal Analysis -- Computable Riemann Surfaces -- Rank Lower Bounds for the Sherali-Adams Operator -- Infinite Computations and a Hierarchy in ? 3 -- Natural Computing: A Natural and Timely Trend for Natural Sciences and Science of Computation -- Biochemical Reactions as Computations -- Doing Without Turing Machines: Constructivism and Formal Topology -- Problems as Solutions -- A Useful Undecidable Theory -- On the Computational Power of Flip-Flop Proteins on Membranes -- Computability and Incomputability -- A Jump Inversion Theorem for the Degree Spectra -- Cupping Enumeration Degrees to 0 e ? -- What Is the Lesson of Quantum Computing? -- Does the Cell Compute? -- Computational Complexity of Constraint Satisfaction -- Finding Most Likely Solutions -- Turing Unbound: Transfinite Computation -- Computability in Amorphous Structures -- The Complexity of Small Universal Turing Machines -- Approximating Generalized Multicut on Trees -- (Short) Survey of Real Hypercomputation -- Characterizing Programming Systems Allowing Program Self-reference. |
| Record Nr. | UNINA-9910483765103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and Applications of Models of Computation [[electronic resource] ] : 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings / / edited by Jin-Yi Cai, Barry S. Cooper, Hong Zhu
| Theory and Applications of Models of Computation [[electronic resource] ] : 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings / / edited by Jin-Yi Cai, Barry S. Cooper, Hong Zhu |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (783 p.) |
| Disciplina | 511.3 |
| 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 |
1-280-95658-5
9786610956586 3-540-72504-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Plenary Lectures -- Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm -- Generalizations of the Compactness Theorem and Gödel’s Completeness Theorem for Nonstandard Finite Structures -- Contributed Papers -- Approximation Algorithms for 3D Orthogonal Knapsack -- A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences -- The Hardness of Selective Network Design for Bottleneck Routing Games -- A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns -- Elementary Differences Among Jump Hierarchies -- Working with the LR Degrees -- Computability on Subsets of Locally Compact Spaces -- A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs -- Finding a Duplicate and a Missing Item in a Stream -- Directed Searching Digraphs: Monotonicity and Complexity -- Protecting Against Key Escrow and Key Exposure in Identity-Based Cryptosystem -- Encapsulated Scalar Multiplications and Line Functions in the Computation of Tate Pairing -- A Provably Secure Blind Signature Scheme -- Construct Public Key Encryption Scheme Using Ergodic Matrices over GF(2) -- New Left-to-Right Radix-r Signed-Digit Recoding Algorithm for Pairing-Based Cryptosystems -- The Strongest Nonsplitting Theorem -- There is an Sw-Cuppable Strongly c.e. Real -- On Computation Complexity of the Concurrently Enabled Transition Set Problem -- Synchronization of Some DFA -- On the Treewidth and Pathwidth of Biconvex Bipartite Graphs -- On Exact Complexity of Subgraph Homeomorphism -- Searching a Polygonal Region by Two Guards -- On the Internal Steiner Tree Problem -- Approximately Optimal Trees for Group Key Management with Batch Updates -- On Deciding Deep Holes of Reed-Solomon Codes -- Quantum Multiparty Communication Complexity and Circuit Lower Bounds -- Efficient Computation of Algebraic Immunity of Symmetric Boolean Functions -- Improving the Average Delay of Sorting -- Approximating Capacitated Tree-Routings in Networks -- Feedback Arc Set Problem in Bipartite Tournaments -- Studying on Economic-Inspired Mechanisms for Routing and Forwarding in Wireless Ad Hoc Network -- Enhancing Simulation for Checking Language Containment -- QBF-Based Symbolic Model Checking for Knowledge and Time -- A Characterization of the Language Classes Learnable with Correction Queries -- Learnable Algorithm on the Continuum -- Online Deadline Scheduling with Bounded Energy Efficiency -- Efficient Algorithms for Airline Problem -- Efficient Exact Arithmetic over Constructive Reals -- Bounding Run-Times of Local Adiabatic Algorithms -- A Note on Universal Composable Zero Knowledge in Common Reference String Model -- A Note on the Feasibility of Generalized Universal Composability -- t-Private and Secure Auctions -- Secure Multiparty Computations Using a Dial Lock -- A Time Hierarchy Theorem for Nondeterministic Cellular Automata -- Decidability of Propositional Projection Temporal Logic with Infinite Models -- Separation of Data Via Concurrently Determined Discriminant Functions -- The Undecidability of the Generalized Collatz Problem -- Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces -- Maximum Edge-Disjoint Paths Problem in Planar Graphs -- An Efficient Algorithm for Generating Colored Outerplanar Graphs -- Orthogonal Drawings for Plane Graphs with Specified Face Areas -- Absolutely Non-effective Predicates and Functions in Computable Analysis -- Linear-Size Log-Depth Negation-Limited Inverter for k-Tonic Binary Sequences -- The Existence of Unsatisfiable Formulas in k-LCNF for k???3 -- Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model -- Phase Transition of Multivariate Polynomial Systems -- Approximation Algorithms for Maximum Edge Coloring Problem -- Two Improved Range-Efficient Algorithms for F 0 Estimation -- Approximation to the Minimum Rooted Star Cover Problem -- Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems -- Parameterized Algorithms for Weighted Matching and Packing Problems -- Kernelizations for Parameterized Counting Problems -- Revisiting the Impossibility for Boosting Service Resilience -- An Approximation Algorithm to the k-Steiner Forest Problem -- A Distributed Algorithm of Fault Recovery for Stateful Failover -- Path Embedding on Folded Hypercubes -- An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs. |
| Record Nr. | UNISA-996465766203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory and Applications of Models of Computation [[electronic resource] ] : 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings / / edited by Jin-Yi Cai, Barry S. Cooper, Hong Zhu
| Theory and Applications of Models of Computation [[electronic resource] ] : 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings / / edited by Jin-Yi Cai, Barry S. Cooper, Hong Zhu |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (783 p.) |
| Disciplina | 511.3 |
| 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 |
1-280-95658-5
9786610956586 3-540-72504-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Plenary Lectures -- Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm -- Generalizations of the Compactness Theorem and Gödel’s Completeness Theorem for Nonstandard Finite Structures -- Contributed Papers -- Approximation Algorithms for 3D Orthogonal Knapsack -- A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences -- The Hardness of Selective Network Design for Bottleneck Routing Games -- A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns -- Elementary Differences Among Jump Hierarchies -- Working with the LR Degrees -- Computability on Subsets of Locally Compact Spaces -- A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs -- Finding a Duplicate and a Missing Item in a Stream -- Directed Searching Digraphs: Monotonicity and Complexity -- Protecting Against Key Escrow and Key Exposure in Identity-Based Cryptosystem -- Encapsulated Scalar Multiplications and Line Functions in the Computation of Tate Pairing -- A Provably Secure Blind Signature Scheme -- Construct Public Key Encryption Scheme Using Ergodic Matrices over GF(2) -- New Left-to-Right Radix-r Signed-Digit Recoding Algorithm for Pairing-Based Cryptosystems -- The Strongest Nonsplitting Theorem -- There is an Sw-Cuppable Strongly c.e. Real -- On Computation Complexity of the Concurrently Enabled Transition Set Problem -- Synchronization of Some DFA -- On the Treewidth and Pathwidth of Biconvex Bipartite Graphs -- On Exact Complexity of Subgraph Homeomorphism -- Searching a Polygonal Region by Two Guards -- On the Internal Steiner Tree Problem -- Approximately Optimal Trees for Group Key Management with Batch Updates -- On Deciding Deep Holes of Reed-Solomon Codes -- Quantum Multiparty Communication Complexity and Circuit Lower Bounds -- Efficient Computation of Algebraic Immunity of Symmetric Boolean Functions -- Improving the Average Delay of Sorting -- Approximating Capacitated Tree-Routings in Networks -- Feedback Arc Set Problem in Bipartite Tournaments -- Studying on Economic-Inspired Mechanisms for Routing and Forwarding in Wireless Ad Hoc Network -- Enhancing Simulation for Checking Language Containment -- QBF-Based Symbolic Model Checking for Knowledge and Time -- A Characterization of the Language Classes Learnable with Correction Queries -- Learnable Algorithm on the Continuum -- Online Deadline Scheduling with Bounded Energy Efficiency -- Efficient Algorithms for Airline Problem -- Efficient Exact Arithmetic over Constructive Reals -- Bounding Run-Times of Local Adiabatic Algorithms -- A Note on Universal Composable Zero Knowledge in Common Reference String Model -- A Note on the Feasibility of Generalized Universal Composability -- t-Private and Secure Auctions -- Secure Multiparty Computations Using a Dial Lock -- A Time Hierarchy Theorem for Nondeterministic Cellular Automata -- Decidability of Propositional Projection Temporal Logic with Infinite Models -- Separation of Data Via Concurrently Determined Discriminant Functions -- The Undecidability of the Generalized Collatz Problem -- Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces -- Maximum Edge-Disjoint Paths Problem in Planar Graphs -- An Efficient Algorithm for Generating Colored Outerplanar Graphs -- Orthogonal Drawings for Plane Graphs with Specified Face Areas -- Absolutely Non-effective Predicates and Functions in Computable Analysis -- Linear-Size Log-Depth Negation-Limited Inverter for k-Tonic Binary Sequences -- The Existence of Unsatisfiable Formulas in k-LCNF for k???3 -- Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model -- Phase Transition of Multivariate Polynomial Systems -- Approximation Algorithms for Maximum Edge Coloring Problem -- Two Improved Range-Efficient Algorithms for F 0 Estimation -- Approximation to the Minimum Rooted Star Cover Problem -- Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems -- Parameterized Algorithms for Weighted Matching and Packing Problems -- Kernelizations for Parameterized Counting Problems -- Revisiting the Impossibility for Boosting Service Resilience -- An Approximation Algorithm to the k-Steiner Forest Problem -- A Distributed Algorithm of Fault Recovery for Stateful Failover -- Path Embedding on Folded Hypercubes -- An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs. |
| Record Nr. | UNINA-9910484985403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||