top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
Algorithmic Aspects of Cloud Computing [[electronic resource] ] : First International Workshop, ALGOCLOUD 2015, Patras, Greece, September 14-15, 2015. Revised Selected Papers / / edited by Ioannis Karydis, Spyros Sioutas, Peter Triantafillou, Dimitrios Tsoumakos
Algorithmic Aspects of Cloud Computing [[electronic resource] ] : First International Workshop, ALGOCLOUD 2015, Patras, Greece, September 14-15, 2015. Revised Selected Papers / / edited by Ioannis Karydis, Spyros Sioutas, Peter Triantafillou, Dimitrios Tsoumakos
Edizione [1st ed. 2016.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Descrizione fisica 1 online resource (XIV, 193 p. 49 illus. in color.)
Disciplina 004
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Software engineering
Machine theory
Artificial intelligence
Computer science—Mathematics
Discrete mathematics
Computer Science Logic and Foundations of Programming
Software Engineering
Formal Languages and Automata Theory
Artificial Intelligence
Discrete Mathematics in Computer Science
ISBN 3-319-29919-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Tutorials -- Algorithmic Aspects of Large-Scale Data Stores -- Software Tools and Distributed Architectures for Cloud-based Data Management.
Record Nr. UNINA-9910484309103321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithmic Decision Theory [[electronic resource] ] : First International Conference, ADT 2009, Venice, Italy, October 2009, Proceedings / / edited by Francesca Rossi, Alexis Tsoukias
Algorithmic Decision Theory [[electronic resource] ] : First International Conference, ADT 2009, Venice, Italy, October 2009, Proceedings / / edited by Francesca Rossi, Alexis Tsoukias
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Descrizione fisica 1 online resource (XII, 460 p.)
Disciplina 005.1
Collana Lecture Notes in Artificial Intelligence
Soggetto topico Mathematical logic
Computer science—Mathematics
Discrete mathematics
Mathematical statistics
Mathematical Logic and Formal Languages
Mathematics of Computing
Discrete Mathematics
Discrete Mathematics in Computer Science
Probability and Statistics in Computer Science
Symbolic and Algebraic Manipulation
ISBN 3-642-04428-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Social Choice Theory -- A Complete Conclusion-Based Procedure for Judgment Aggregation -- A Geometric Approach to Paradoxes of Majority Voting in Abstract Aggregation Theory -- Manipulating Tournaments in Cup and Round Robin Competitions -- Iterated Majority Voting -- Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals -- The Effects of Noise and Manipulation on the Accuracy of Collective Decision Rules -- Subset Weight Maximization with Two Competing Agents -- The Complexity of Probabilistic Lobbying -- On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences -- On Low-Envy Truthful Allocations -- On Multi-dimensional Envy-Free Mechanisms -- Stable Rankings in Collective Decision Making with Imprecise Information -- Finding Best k Policies -- Multiple Criteria Decision Analysis -- New Hybrid Recommender Approaches: An Application to Equity Funds Selection -- A Prescriptive Approach for Eliciting Imprecise Weight Statements in an MCDA Process -- Inverse Analysis from a Condorcet Robustness Denotation of Valued Outranking Relations -- Directional Decomposition of Multiattribute Utility Functions -- The Possible and the Necessary for Multiple Criteria Group Decision -- Preferences in an Open World -- Extending Argumentation to Make Good Decisions -- Building Consistent Pairwise Comparison Matrices over Abelian Linearly Ordered Groups -- Aggregating Interval Orders by Propositional Optimization -- Circular Representations of a Valued Preference Matrix -- Decision under Uncertainty -- The First Belief Dominance: A New Approach in Evidence Theory for Comparing Basic Belief Assignments -- Interpreting GUHA Data Mining Logic in Paraconsistent Fuzzy Logic Framework -- Insuring Risk-Averse Agents -- Adversarial Risk Analysis: Applications to Basic Counterterrorism Models -- Game Theory without Decision-Theoretic Paradoxes -- Ranking Methods Based on Dominance Measures Accounting for Imprecision -- Optimisation -- Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities -- Axioms for a Class of Algorithms of Sequential Decision Making -- Algorithmic Aspects of Scenario-Based Multi-stage Decision Process Optimization -- Choquet Optimization Using GAI Networks for Multiagent/Multicriteria Decision-Making -- Compact Preference Representation in Stable Marriage Problems -- Neuroevolutionary Inventory Control in Multi-Echelon Systems -- Determining a Minimum Spanning Tree with Disjunctive Constraints -- Learning -- An Inductive Methodology for Data-Based Rules Building -- A Framework for Designing a Fuzzy Rule-Based Classifier -- Anytime Self-play Learning to Satisfy Functional Optimality Criteria.
Record Nr. UNISA-996465280003316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithmic Decision Theory [[electronic resource] ] : First International Conference, ADT 2009, Venice, Italy, October 2009, Proceedings / / edited by Francesca Rossi, Alexis Tsoukias
Algorithmic Decision Theory [[electronic resource] ] : First International Conference, ADT 2009, Venice, Italy, October 2009, Proceedings / / edited by Francesca Rossi, Alexis Tsoukias
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Descrizione fisica 1 online resource (XII, 460 p.)
Disciplina 005.1
Collana Lecture Notes in Artificial Intelligence
Soggetto topico Mathematical logic
Computer science—Mathematics
Discrete mathematics
Mathematical statistics
Mathematical Logic and Formal Languages
Mathematics of Computing
Discrete Mathematics
Discrete Mathematics in Computer Science
Probability and Statistics in Computer Science
Symbolic and Algebraic Manipulation
ISBN 3-642-04428-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Social Choice Theory -- A Complete Conclusion-Based Procedure for Judgment Aggregation -- A Geometric Approach to Paradoxes of Majority Voting in Abstract Aggregation Theory -- Manipulating Tournaments in Cup and Round Robin Competitions -- Iterated Majority Voting -- Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals -- The Effects of Noise and Manipulation on the Accuracy of Collective Decision Rules -- Subset Weight Maximization with Two Competing Agents -- The Complexity of Probabilistic Lobbying -- On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences -- On Low-Envy Truthful Allocations -- On Multi-dimensional Envy-Free Mechanisms -- Stable Rankings in Collective Decision Making with Imprecise Information -- Finding Best k Policies -- Multiple Criteria Decision Analysis -- New Hybrid Recommender Approaches: An Application to Equity Funds Selection -- A Prescriptive Approach for Eliciting Imprecise Weight Statements in an MCDA Process -- Inverse Analysis from a Condorcet Robustness Denotation of Valued Outranking Relations -- Directional Decomposition of Multiattribute Utility Functions -- The Possible and the Necessary for Multiple Criteria Group Decision -- Preferences in an Open World -- Extending Argumentation to Make Good Decisions -- Building Consistent Pairwise Comparison Matrices over Abelian Linearly Ordered Groups -- Aggregating Interval Orders by Propositional Optimization -- Circular Representations of a Valued Preference Matrix -- Decision under Uncertainty -- The First Belief Dominance: A New Approach in Evidence Theory for Comparing Basic Belief Assignments -- Interpreting GUHA Data Mining Logic in Paraconsistent Fuzzy Logic Framework -- Insuring Risk-Averse Agents -- Adversarial Risk Analysis: Applications to Basic Counterterrorism Models -- Game Theory without Decision-Theoretic Paradoxes -- Ranking Methods Based on Dominance Measures Accounting for Imprecision -- Optimisation -- Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities -- Axioms for a Class of Algorithms of Sequential Decision Making -- Algorithmic Aspects of Scenario-Based Multi-stage Decision Process Optimization -- Choquet Optimization Using GAI Networks for Multiagent/Multicriteria Decision-Making -- Compact Preference Representation in Stable Marriage Problems -- Neuroevolutionary Inventory Control in Multi-Echelon Systems -- Determining a Minimum Spanning Tree with Disjunctive Constraints -- Learning -- An Inductive Methodology for Data-Based Rules Building -- A Framework for Designing a Fuzzy Rule-Based Classifier -- Anytime Self-play Learning to Satisfy Functional Optimality Criteria.
Record Nr. UNINA-9910484102003321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithmic Methods for Railway Optimization [[electronic resource] ] : International Dagstuhl Workshop, Railway Optimization 2004, Dagstuhl Castle, Germany, June 20-25, 2004, Bergen, Norway, September 16-17, 2004, Revised Selected Papers / / edited by Frank Geraets, Leo Kroon, Anita Schoebel, Dorothea Wagner, Christos Zaroliagiis
Algorithmic Methods for Railway Optimization [[electronic resource] ] : International Dagstuhl Workshop, Railway Optimization 2004, Dagstuhl Castle, Germany, June 20-25, 2004, Bergen, Norway, September 16-17, 2004, Revised Selected Papers / / edited by Frank Geraets, Leo Kroon, Anita Schoebel, Dorothea Wagner, Christos Zaroliagiis
Edizione [1st ed. 2007.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Descrizione fisica 1 online resource (XVI, 322 p.)
Disciplina 004
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Transportation engineering
Traffic engineering
Artificial intelligence—Data processing
Computer science—Mathematics
Discrete mathematics
Artificial intelligence
Computer graphics
Transportation Technology and Traffic Engineering
Data Science
Discrete Mathematics in Computer Science
Artificial Intelligence
Computer Graphics
ISBN 3-540-74247-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto State of the Art -- The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables — and Beyond -- Cyclic Railway Timetabling: A Stochastic Optimization Approach -- Timetable Information: Models and Algorithms -- Estimates on Rolling Stock and Crew in DSB S-tog Based on Timetables -- A Capacity Test for Shunting Movements -- Railway Crew Pairing Optimization -- Integer Programming Approaches for Solving the Delay Management Problem -- Decision Support Tools for Customer-Oriented Dispatching -- Proceedings of ATMOS 2004 -- An Integrated Methodology for the Rapid Transit Network Design Problem -- A Simulation Approach of Fare Integration in Regional Transit Services -- Intelligent Train Scheduling on a High-Loaded Railway Network -- Platform Assignment -- Finding All Attractive Train Connections by Multi-criteria Pareto Search -- The Railway Traveling Salesman Problem -- Rotation Planning of Locomotive and Carriage Groups with Shared Capacities -- An Estimate of the Punctuality Benefits of Automatic Operational Train Sequencing -- Online Delay Management on a Single Train Line.
Record Nr. UNISA-996465434203316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithmic Methods for Railway Optimization [[electronic resource] ] : International Dagstuhl Workshop, Railway Optimization 2004, Dagstuhl Castle, Germany, June 20-25, 2004, Bergen, Norway, September 16-17, 2004, Revised Selected Papers / / edited by Frank Geraets, Leo Kroon, Anita Schoebel, Dorothea Wagner, Christos Zaroliagiis
Algorithmic Methods for Railway Optimization [[electronic resource] ] : International Dagstuhl Workshop, Railway Optimization 2004, Dagstuhl Castle, Germany, June 20-25, 2004, Bergen, Norway, September 16-17, 2004, Revised Selected Papers / / edited by Frank Geraets, Leo Kroon, Anita Schoebel, Dorothea Wagner, Christos Zaroliagiis
Edizione [1st ed. 2007.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Descrizione fisica 1 online resource (XVI, 322 p.)
Disciplina 004
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Transportation engineering
Traffic engineering
Artificial intelligence—Data processing
Computer science—Mathematics
Discrete mathematics
Artificial intelligence
Computer graphics
Transportation Technology and Traffic Engineering
Data Science
Discrete Mathematics in Computer Science
Artificial Intelligence
Computer Graphics
ISBN 3-540-74247-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto State of the Art -- The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables — and Beyond -- Cyclic Railway Timetabling: A Stochastic Optimization Approach -- Timetable Information: Models and Algorithms -- Estimates on Rolling Stock and Crew in DSB S-tog Based on Timetables -- A Capacity Test for Shunting Movements -- Railway Crew Pairing Optimization -- Integer Programming Approaches for Solving the Delay Management Problem -- Decision Support Tools for Customer-Oriented Dispatching -- Proceedings of ATMOS 2004 -- An Integrated Methodology for the Rapid Transit Network Design Problem -- A Simulation Approach of Fare Integration in Regional Transit Services -- Intelligent Train Scheduling on a High-Loaded Railway Network -- Platform Assignment -- Finding All Attractive Train Connections by Multi-criteria Pareto Search -- The Railway Traveling Salesman Problem -- Rotation Planning of Locomotive and Carriage Groups with Shared Capacities -- An Estimate of the Punctuality Benefits of Automatic Operational Train Sequencing -- Online Delay Management on a Single Train Line.
Record Nr. UNINA-9910768164303321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithmic Number Theory [[electronic resource] ] : 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010, Proceedings / / edited by Guillaume Hanrot, Francois Morain, Emmanuel Thomé
Algorithmic Number Theory [[electronic resource] ] : 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010, Proceedings / / edited by Guillaume Hanrot, Francois Morain, Emmanuel Thomé
Edizione [1st ed. 2010.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Descrizione fisica 1 online resource (XI, 397 p. 15 illus.)
Disciplina 512.7
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Cryptography
Data encryption (Computer science)
Number theory
Discrete Mathematics in Computer Science
Cryptology
Symbolic and Algebraic Manipulation
Number Theory
ISBN 1-280-38804-8
9786613565969
3-642-14518-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited papers -- Putting the Hodge and Tate Conjectures to the Test -- Curves of Genus 3 with a Group of Automorphisms Isomorphic to S3 -- Learning with Errors over Rings -- Lattices and Spherical Designs -- Fixed Points for Discrete Logarithms -- Contributed papers -- Explicit Coleman Integration for Hyperelliptic Curves -- Smallest Reduction Matrix of Binary Quadratic Forms -- Practical Improvements to Class Group and Regulator Computation of Real Quadratic Fields -- On the Use of the Negation Map in the Pollard Rho Method -- An O(M(n) logn) Algorithm for the Jacobi Symbol -- New Families of ECM Curves for Cunningham Numbers -- Visualizing Elements of Sha[3] in Genus 2 Jacobians -- On Weil Polynomials of K3 Surfaces -- Class Invariants by the CRT Method -- Short Bases of Lattices over Number Fields -- On the Complexity of the Montes Ideal Factorization Algorithm -- Congruent Number Theta Coefficients to 1012 -- Pairing the Volcano -- A Subexponential Algorithm for Evaluating Large Degree Isogenies -- Huff’s Model for Elliptic Curves -- Efficient Pairing Computation with Theta Functions -- Small-Span Characteristic Polynomials of Integer Symmetric Matrices -- Decomposition Attack for the Jacobian of a Hyperelliptic Curve over an Extension Field -- Factoring Polynomials over Local Fields II -- On a Problem of Hajdu and Tengely -- Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumeration and Wheel Datastructures -- On the Extremality of an 80-Dimensional Lattice -- Computing Automorphic Forms on Shimura Curves over Fields with Arbitrary Class Number -- Improved Primality Proving with Eisenstein Pseudocubes -- Hyperbolic Tessellations Associated to Bianchi Groups.
Record Nr. UNISA-996465804803316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithmic Number Theory [[electronic resource] ] : 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010, Proceedings / / edited by Guillaume Hanrot, Francois Morain, Emmanuel Thomé
Algorithmic Number Theory [[electronic resource] ] : 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010, Proceedings / / edited by Guillaume Hanrot, Francois Morain, Emmanuel Thomé
Edizione [1st ed. 2010.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Descrizione fisica 1 online resource (XI, 397 p. 15 illus.)
Disciplina 512.7
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Cryptography
Data encryption (Computer science)
Number theory
Discrete Mathematics in Computer Science
Cryptology
Symbolic and Algebraic Manipulation
Number Theory
ISBN 1-280-38804-8
9786613565969
3-642-14518-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited papers -- Putting the Hodge and Tate Conjectures to the Test -- Curves of Genus 3 with a Group of Automorphisms Isomorphic to S3 -- Learning with Errors over Rings -- Lattices and Spherical Designs -- Fixed Points for Discrete Logarithms -- Contributed papers -- Explicit Coleman Integration for Hyperelliptic Curves -- Smallest Reduction Matrix of Binary Quadratic Forms -- Practical Improvements to Class Group and Regulator Computation of Real Quadratic Fields -- On the Use of the Negation Map in the Pollard Rho Method -- An O(M(n) logn) Algorithm for the Jacobi Symbol -- New Families of ECM Curves for Cunningham Numbers -- Visualizing Elements of Sha[3] in Genus 2 Jacobians -- On Weil Polynomials of K3 Surfaces -- Class Invariants by the CRT Method -- Short Bases of Lattices over Number Fields -- On the Complexity of the Montes Ideal Factorization Algorithm -- Congruent Number Theta Coefficients to 1012 -- Pairing the Volcano -- A Subexponential Algorithm for Evaluating Large Degree Isogenies -- Huff’s Model for Elliptic Curves -- Efficient Pairing Computation with Theta Functions -- Small-Span Characteristic Polynomials of Integer Symmetric Matrices -- Decomposition Attack for the Jacobian of a Hyperelliptic Curve over an Extension Field -- Factoring Polynomials over Local Fields II -- On a Problem of Hajdu and Tengely -- Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumeration and Wheel Datastructures -- On the Extremality of an 80-Dimensional Lattice -- Computing Automorphic Forms on Shimura Curves over Fields with Arbitrary Class Number -- Improved Primality Proving with Eisenstein Pseudocubes -- Hyperbolic Tessellations Associated to Bianchi Groups.
Record Nr. UNINA-9910483761503321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithmic Number Theory [[electronic resource] ] : 8th International Symposium, ANTS-VIII Banff, Canada, May 17-22, 2008 Proceedings / / edited by Alf J. van der Poorten, Andreas Stein
Algorithmic Number Theory [[electronic resource] ] : 8th International Symposium, ANTS-VIII Banff, Canada, May 17-22, 2008 Proceedings / / edited by Alf J. van der Poorten, Andreas Stein
Edizione [1st ed. 2008.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008
Descrizione fisica 1 online resource (IX, 458 p.)
Disciplina 512
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Cryptography
Data encryption (Computer science)
Number theory
Discrete Mathematics in Computer Science
Cryptology
Symbolic and Algebraic Manipulation
Number Theory
ISBN 3-540-79456-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- Running Time Predictions for Factoring Algorithms -- A New Look at an Old Equation -- Elliptic Curves Cryptology and Generalizations -- Abelian Varieties with Prescribed Embedding Degree -- Almost Prime Orders of CM Elliptic Curves Modulo p -- Efficiently Computable Distortion Maps for Supersingular Curves -- On Prime-Order Elliptic Curves with Embedding Degrees k?=?3, 4, and 6 -- Arithmetic of Elliptic Curves -- Computing in Component Groups of Elliptic Curves -- Some Improvements to 4-Descent on an Elliptic Curve -- Computing a Lower Bound for the Canonical Height on Elliptic Curves over Totally Real Number Fields -- Faster Multiplication in GF(2)[x] -- Integer Factorization -- Predicting the Sieving Effort for the Number Field Sieve -- Improved Stage 2 to P ± 1 Factoring Algorithms -- K3 Surfaces -- Shimura Curve Computations Via K3 Surfaces of Néron–Severi Rank at Least 19 -- K3 Surfaces of Picard Rank One and Degree Two -- Number Fields -- Number Fields Ramified at One Prime -- An Explicit Construction of Initial Perfect Quadratic Forms over Some Families of Totally Real Number Fields -- Functorial Properties of Stark Units in Multiquadratic Extensions -- Enumeration of Totally Real Number Fields of Bounded Root Discriminant -- Point Counting -- Computing Hilbert Class Polynomials -- Computing Zeta Functions in Families of C a,b Curves Using Deformation -- Computing L-Series of Hyperelliptic Curves -- Point Counting on Singular Hypersurfaces -- Arithmetic of Function Fields -- Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors -- Tabulation of Cubic Function Fields with Imaginary and Unusual Hessian -- Modular Forms -- Computing Hilbert Modular Forms over Fields with Nontrivial Class Group -- Hecke Operators and Hilbert Modular Forms -- Cryptography -- A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm -- An Improved Multi-set Algorithm for the Dense Subset Sum Problem -- Number Theory -- On the Diophantine Equation x 2?+?2 ? 5 ? 13 ? ?=?y n -- Non-vanishing of Dirichlet L-functions at the Central Point.
Record Nr. UNISA-996465609503316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithmic Number Theory [[electronic resource] ] : 8th International Symposium, ANTS-VIII Banff, Canada, May 17-22, 2008 Proceedings / / edited by Alf J. van der Poorten, Andreas Stein
Algorithmic Number Theory [[electronic resource] ] : 8th International Symposium, ANTS-VIII Banff, Canada, May 17-22, 2008 Proceedings / / edited by Alf J. van der Poorten, Andreas Stein
Edizione [1st ed. 2008.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008
Descrizione fisica 1 online resource (IX, 458 p.)
Disciplina 512
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Cryptography
Data encryption (Computer science)
Number theory
Discrete Mathematics in Computer Science
Cryptology
Symbolic and Algebraic Manipulation
Number Theory
ISBN 3-540-79456-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- Running Time Predictions for Factoring Algorithms -- A New Look at an Old Equation -- Elliptic Curves Cryptology and Generalizations -- Abelian Varieties with Prescribed Embedding Degree -- Almost Prime Orders of CM Elliptic Curves Modulo p -- Efficiently Computable Distortion Maps for Supersingular Curves -- On Prime-Order Elliptic Curves with Embedding Degrees k?=?3, 4, and 6 -- Arithmetic of Elliptic Curves -- Computing in Component Groups of Elliptic Curves -- Some Improvements to 4-Descent on an Elliptic Curve -- Computing a Lower Bound for the Canonical Height on Elliptic Curves over Totally Real Number Fields -- Faster Multiplication in GF(2)[x] -- Integer Factorization -- Predicting the Sieving Effort for the Number Field Sieve -- Improved Stage 2 to P ± 1 Factoring Algorithms -- K3 Surfaces -- Shimura Curve Computations Via K3 Surfaces of Néron–Severi Rank at Least 19 -- K3 Surfaces of Picard Rank One and Degree Two -- Number Fields -- Number Fields Ramified at One Prime -- An Explicit Construction of Initial Perfect Quadratic Forms over Some Families of Totally Real Number Fields -- Functorial Properties of Stark Units in Multiquadratic Extensions -- Enumeration of Totally Real Number Fields of Bounded Root Discriminant -- Point Counting -- Computing Hilbert Class Polynomials -- Computing Zeta Functions in Families of C a,b Curves Using Deformation -- Computing L-Series of Hyperelliptic Curves -- Point Counting on Singular Hypersurfaces -- Arithmetic of Function Fields -- Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors -- Tabulation of Cubic Function Fields with Imaginary and Unusual Hessian -- Modular Forms -- Computing Hilbert Modular Forms over Fields with Nontrivial Class Group -- Hecke Operators and Hilbert Modular Forms -- Cryptography -- A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm -- An Improved Multi-set Algorithm for the Dense Subset Sum Problem -- Number Theory -- On the Diophantine Equation x 2?+?2 ? 5 ? 13 ? ?=?y n -- Non-vanishing of Dirichlet L-functions at the Central Point.
Record Nr. UNINA-9910484523303321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithmic Number Theory [[electronic resource] ] : First International Symposium, ANTS-I, Ithaca, NY, USA, May 6 - 9, 1994. Proceedings / / edited by Leonard M. Adleman, Ming-Deh Huang
Algorithmic Number Theory [[electronic resource] ] : First International Symposium, ANTS-I, Ithaca, NY, USA, May 6 - 9, 1994. Proceedings / / edited by Leonard M. Adleman, Ming-Deh Huang
Edizione [1st ed. 1994.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994
Descrizione fisica 1 online resource (X, 320 p.)
Disciplina 512/.7
Collana Lecture Notes in Computer Science
Soggetto topico Data structures (Computer science)
Number theory
Discrete mathematics
Computer science—Mathematics
Algorithms
Combinatorics
Data Structures
Number Theory
Discrete Mathematics
Symbolic and Algebraic Manipulation
Algorithm Analysis and Problem Complexity
ISBN 3-540-49044-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto On the difficulty of finding reliable witnesses -- Density computations for real quadratic 2-class groups -- Lattice sieving and trial division -- A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields -- Computing rates of growth of division fields on CM Abelian varieties -- Algorithms for CM-Fields -- Schoof's algorithm and isogeny cycles -- Integer points on rational elliptic curves -- Counting the number of points on elliptic curves over finite fields of characteristic greater than three -- Straight-line complexity and integer factorization -- Decomposition of algebraic functions -- A new modular interpolation algorithm for factoring multivariate polynomials -- The function field sieve -- Heegner point computations -- Computing the degree of a modular parametrization -- Galois representations from the cohomology of SL(3,?) -- An analysis of the Gaussian algorithm for lattice reduction -- A fast variant of the Gaussian reduction algorithm -- Reducing lattice bases by means of approximations -- Analysis of a left-shift binary GCD algorithm -- The complexity of greatest common divisor computations -- Explicit formulas for units in certain quadratic number fields -- Factorization of polynomials over finite fields in subexponential time under GRH -- On orders of optimal normal basis generators -- Computing in the jacobian of a plane algebraic curve -- Under the assumption of the Generalized Riemann Hypothesis verifying the class number belongs to NP ? co-NP -- Calculating the class number of certain Hilbert class fields -- Efficient checking of computations in number theory -- Constructing elliptic curves with given group order over large finite fields -- Computing ?(x), M(x) and ?(x) -- On some applications of finitely generated semi-groups -- Improved incremental prime number sieves -- Polynomial time algorithms for discrete logarithms and factoring on a quantum computer -- On dispersion and Markov constants -- Open problems in number theoretic complexity, II.
Record Nr. UNISA-996466151203316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui