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 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Computability and Complexity : 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 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management [[electronic resource] ] : Third Joint International Conference, FAW-AAIM 2013, Dalian,China, June 26-28, 2013, Proceedings / / edited by Michael Fellows, Xuehou Tan, Binhai Zhu |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XII, 364 p. 97 illus.) : digital |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer science Electronic data processing—Management Artificial intelligence—Data processing Discrete Mathematics in Computer Science Mathematics of Computing Theory of Computation IT Operations Data Science |
ISBN | 3-642-38756-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996466301103316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management : Third Joint International Conference, FAW-AAIM 2013, Dalian,China, June 26-28, 2013, Proceedings / / edited by Michael Fellows, Xuehou Tan, Binhai Zhu |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XII, 364 p. 97 illus.) : digital |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer science Electronic data processing—Management Artificial intelligence—Data processing Discrete Mathematics in Computer Science Mathematics of Computing Theory of Computation IT Operations Data Science |
ISBN | 3-642-38756-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910483316203321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Parameterized and Exact Computation [[electronic resource] ] : First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings / / edited by Frank Dehne, Rod Downey, Michael Fellows |
Edizione | [1st ed. 2004.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
Descrizione fisica | 1 online resource (X, 298 p.) |
Disciplina | 519.5/44 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Algorithms
Probabilities Application software Computers Data structures (Computer science) Computer science—Mathematics Algorithm Analysis and Problem Complexity Probability Theory and Stochastic Processes Computer Applications Computation by Abstract Devices Data Structures Discrete Mathematics in Computer Science |
ISBN |
1-280-30821-4
9786610308217 3-540-28639-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction -- Online Problems, Pathwidth, and Persistence -- Chordless Paths Through Three Vertices -- Computing Small Search Numbers in Linear Time -- Bounded Fixed-Parameter Tractability: The Case 2poly( k) -- Refined Memorisation for Vertex Cover -- Parameterized Graph Separation Problems -- Parameterized Coloring Problems on Chordal Graphs -- On Decidability of MSO Theories of Representable Matroids -- On Miniaturized Problems in Parameterized Complexity Theory -- Smaller Kernels for Hitting Set Problems of Constant Arity -- Packing Edge Disjoint Triangles: A Parameterized View -- Looking at the Stars -- Moving Policies in Cyclic Assembly-Line Scheduling -- A Structural View on Parameterizing Problems: Distance from Triviality -- Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable -- Simplifying the Weft Hierarchy -- The Minimum Weight Triangulation Problem with Few Inner Points -- A Direct Algorithm for the Parameterized Face Cover Problem -- On Finding Short Resolution Refutations and Small Unsatisfiable Subsets -- Parameterized Algorithms for Feedback Vertex Set -- Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms -- Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments -- Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover -- Space and Time Complexity of Exact Algorithms: Some Open Problems -- Practical FPT Implementations and Applications. |
Record Nr. | UNISA-996465317803316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Parameterized and Exact Computation : First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings / / edited by Frank Dehne, Rod Downey, Michael Fellows |
Edizione | [1st ed. 2004.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
Descrizione fisica | 1 online resource (X, 298 p.) |
Disciplina | 519.5/44 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Algorithms
Probabilities Application software Computers Data structures (Computer science) Computer science—Mathematics Algorithm Analysis and Problem Complexity Probability Theory and Stochastic Processes Computer Applications Computation by Abstract Devices Data Structures Discrete Mathematics in Computer Science |
ISBN |
1-280-30821-4
9786610308217 3-540-28639-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction -- Online Problems, Pathwidth, and Persistence -- Chordless Paths Through Three Vertices -- Computing Small Search Numbers in Linear Time -- Bounded Fixed-Parameter Tractability: The Case 2poly( k) -- Refined Memorisation for Vertex Cover -- Parameterized Graph Separation Problems -- Parameterized Coloring Problems on Chordal Graphs -- On Decidability of MSO Theories of Representable Matroids -- On Miniaturized Problems in Parameterized Complexity Theory -- Smaller Kernels for Hitting Set Problems of Constant Arity -- Packing Edge Disjoint Triangles: A Parameterized View -- Looking at the Stars -- Moving Policies in Cyclic Assembly-Line Scheduling -- A Structural View on Parameterizing Problems: Distance from Triviality -- Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable -- Simplifying the Weft Hierarchy -- The Minimum Weight Triangulation Problem with Few Inner Points -- A Direct Algorithm for the Parameterized Face Cover Problem -- On Finding Short Resolution Refutations and Small Unsatisfiable Subsets -- Parameterized Algorithms for Feedback Vertex Set -- Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms -- Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments -- Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover -- Space and Time Complexity of Exact Algorithms: Some Open Problems -- Practical FPT Implementations and Applications. |
Record Nr. | UNINA-9910144349103321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|