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.
Algebraic Curves and Riemann Surfaces for Undergraduates [[electronic resource] ] : The Theory of the Donut / / by Anil Nerode, Noam Greenberg
Algebraic Curves and Riemann Surfaces for Undergraduates [[electronic resource] ] : The Theory of the Donut / / by Anil Nerode, Noam Greenberg
Autore Nerode Anil <1932->
Edizione [1st ed. 2022.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022
Descrizione fisica 1 online resource (456 pages)
Disciplina 515.93
Soggetto topico Algebraic geometry
Functions of complex variables
Global analysis (Mathematics)
Manifolds (Mathematics)
Algebraic Geometry
Functions of a Complex Variable
Global Analysis and Analysis on Manifolds
Corbes algebraiques
Geometria algebraica
Superfícies de Riemann
Soggetto genere / forma Llibres electrònics
ISBN 3-031-11616-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1 Introduction -- Part I Algebraic curves -- 2 Algebra -- 3 Affine space -- 4 Projective space -- 5 Tangents -- 6 Bézout’s theorem -- 7 The elliptic group -- Part II Riemann Surfaces -- 8 Quasi-Euclidean spaces -- 9 Connectedness, smooth and simple -- 10 Path integrals -- 11 Complex differentiation -- 12 Riemann surfaces -- Part III Curves and surfaces -- 13 Curves are surfaces -- 14 Elliptic functions and the isomorphism theorem -- 15 Puiseux theory -- 16 A brief history of elliptic functions.
Record Nr. UNINA-9910644265203321
Nerode Anil <1932->  
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algebraic Curves and Riemann Surfaces for Undergraduates [[electronic resource] ] : The Theory of the Donut / / by Anil Nerode, Noam Greenberg
Algebraic Curves and Riemann Surfaces for Undergraduates [[electronic resource] ] : The Theory of the Donut / / by Anil Nerode, Noam Greenberg
Autore Nerode Anil <1932->
Edizione [1st ed. 2022.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022
Descrizione fisica 1 online resource (456 pages)
Disciplina 515.93
Soggetto topico Algebraic geometry
Functions of complex variables
Global analysis (Mathematics)
Manifolds (Mathematics)
Algebraic Geometry
Functions of a Complex Variable
Global Analysis and Analysis on Manifolds
Corbes algebraiques
Geometria algebraica
Superfícies de Riemann
Soggetto genere / forma Llibres electrònics
ISBN 3-031-11616-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1 Introduction -- Part I Algebraic curves -- 2 Algebra -- 3 Affine space -- 4 Projective space -- 5 Tangents -- 6 Bézout’s theorem -- 7 The elliptic group -- Part II Riemann Surfaces -- 8 Quasi-Euclidean spaces -- 9 Connectedness, smooth and simple -- 10 Path integrals -- 11 Complex differentiation -- 12 Riemann surfaces -- Part III Curves and surfaces -- 13 Curves are surfaces -- 14 Elliptic functions and the isomorphism theorem -- 15 Puiseux theory -- 16 A brief history of elliptic functions.
Record Nr. UNISA-996508571503316
Nerode Anil <1932->  
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Computability and Complexity [[electronic resource] ] : Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday / / edited by Adam Day, Michael Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander Melnikov, Frances Rosamond
Computability and Complexity [[electronic resource] ] : Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday / / edited by Adam Day, Michael Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander Melnikov, Frances Rosamond
Edizione [1st ed. 2017.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Descrizione fisica 1 online resource (XLII, 755 p. 22 illus.)
Disciplina 004.0151
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science
Artificial intelligence—Data processing
Computer science—Mathematics
Discrete mathematics
Machine theory
Theory of Computation
Data Science
Discrete Mathematics in Computer Science
Formal Languages and Automata Theory
Computer Science Logic and Foundations of Programming
ISBN 3-319-50062-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cameo of a Consummate Computabilist -- Surfing with Rod -- Prequel to the Cornell Computer Science Department -- Some Questions in Computable Mathematics -- Introduction to Autoreducibility and Mitoticity -- The Complexity of Complexity -- Bounded Pushdown Dimension vs Lempel Ziv Information Density -- On Being Rod's Graduate Student -- Herrmann's Beautiful Theorem on Computable Partial Orderings -- Effectiveness of Hindman's Theorem for Bounded Sums -- Reverse Mathematics of Matroids -- Weakly Represented Families in Reverse Mathematics -- The Vitali Covering Theorem in the Weihrauch Lattice -- Parallel and Serial Jumps of Weak König's Lemma -- Effectively Existentially-Atomic Structures -- Irreducibles and Primes in Computable Integral Domains -- Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey -- Enumeration Reducibility and Computable Structure Theory -- Strength and Weakness in Computable Structure Theory -- On Constructive Nilpotent Groups -- Computable Model Theory over the Reals -- The Lattice of Computably Enumerable Vector Spaces -- Injection Structures Specified by Finite State Transducers -- A Survey on Universal Computably Enumerable Equivalence Relations -- Higher Computability -- Σ1 1 in Every Real in a Σ1 1 Class of Reals is Σ1 -- A Survey of Results on the D-C.E. and N-C.E. Degrees -- There Are no Maximal D.C.E. WTT-Degrees -- A Rigid Cone in the Truth-Table Degrees with Jump -- Asymptotic Density and the Theory of Computability : A Partial Survey -- On Splits of Computably Enumerable Sets -- 1-Generic Degrees Bounding Minimal Degrees Revisited -- Nondensity of Double Bubbles in the D.C.E. Degrees -- On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets -- Permutations of the Integers Induce Only the Trivial Automorphism of the Turing Degrees -- On the Reals which Cannot Be Random -- A Note on the Differences of Computably Enumerable Reals -- Effective Bi-immunity and Randomness -- On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals -- Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions -- Algorithmic Statistics: Forty Years Later -- Lowness, Randomness, and Computable Analysis. .
Record Nr. UNISA-996465509103316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Computability and Complexity [[electronic resource] ] : Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday / / edited by Adam Day, Michael Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander Melnikov, Frances Rosamond
Computability and Complexity [[electronic resource] ] : Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday / / edited by Adam Day, Michael Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander Melnikov, Frances Rosamond
Edizione [1st ed. 2017.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Descrizione fisica 1 online resource (XLII, 755 p. 22 illus.)
Disciplina 004.0151
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science
Artificial intelligence—Data processing
Computer science—Mathematics
Discrete mathematics
Machine theory
Theory of Computation
Data Science
Discrete Mathematics in Computer Science
Formal Languages and Automata Theory
Computer Science Logic and Foundations of Programming
ISBN 3-319-50062-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cameo of a Consummate Computabilist -- Surfing with Rod -- Prequel to the Cornell Computer Science Department -- Some Questions in Computable Mathematics -- Introduction to Autoreducibility and Mitoticity -- The Complexity of Complexity -- Bounded Pushdown Dimension vs Lempel Ziv Information Density -- On Being Rod's Graduate Student -- Herrmann's Beautiful Theorem on Computable Partial Orderings -- Effectiveness of Hindman's Theorem for Bounded Sums -- Reverse Mathematics of Matroids -- Weakly Represented Families in Reverse Mathematics -- The Vitali Covering Theorem in the Weihrauch Lattice -- Parallel and Serial Jumps of Weak König's Lemma -- Effectively Existentially-Atomic Structures -- Irreducibles and Primes in Computable Integral Domains -- Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey -- Enumeration Reducibility and Computable Structure Theory -- Strength and Weakness in Computable Structure Theory -- On Constructive Nilpotent Groups -- Computable Model Theory over the Reals -- The Lattice of Computably Enumerable Vector Spaces -- Injection Structures Specified by Finite State Transducers -- A Survey on Universal Computably Enumerable Equivalence Relations -- Higher Computability -- Σ1 1 in Every Real in a Σ1 1 Class of Reals is Σ1 -- A Survey of Results on the D-C.E. and N-C.E. Degrees -- There Are no Maximal D.C.E. WTT-Degrees -- A Rigid Cone in the Truth-Table Degrees with Jump -- Asymptotic Density and the Theory of Computability : A Partial Survey -- On Splits of Computably Enumerable Sets -- 1-Generic Degrees Bounding Minimal Degrees Revisited -- Nondensity of Double Bubbles in the D.C.E. Degrees -- On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets -- Permutations of the Integers Induce Only the Trivial Automorphism of the Turing Degrees -- On the Reals which Cannot Be Random -- A Note on the Differences of Computably Enumerable Reals -- Effective Bi-immunity and Randomness -- On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals -- Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions -- Algorithmic Statistics: Forty Years Later -- Lowness, Randomness, and Computable Analysis. .
Record Nr. UNINA-9910484452903321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui