A partir de cette page vous pouvez :
Retourner au premier écran avec les dernières notices... |
Catégories
> 68-XX Computer science > 68QXX Theory of computing > 68Q25 Analysis of algorithms and problem complexity
68Q25 Analysis of algorithms and problem complexity
Voir aussi
Affiner la recherche
Advances in computers. Vol. 14 / Marshall C. Yovits ; Rubinoff, Morris
Exemplaires
Code-barres Cote Support Localisation Section Disponibilité 14723 68B15 imprimé / autre CRDM 68/INFORMATIQUE Disponible Algorithms and complexity / Wilf, Herbert S.
Titre : Algorithms and complexity Type de document : texte imprimé Auteurs : Wilf, Herbert S. Mention d'édition : 2nd ed. Editeur : A. K. Peters, Ltd Année de publication : 2002 Importance : ix - 219 p. ISBN/ISSN/EAN : 978-1-56881-178-9 Langues : Anglais Catégories : 68-XX Computer science :68-02 Research exposition (monographs, survey articles)
68-XX Computer science :68QXX Theory of computing:68Q25 Analysis of algorithms and problem complexity
68-XX Computer science :68WXX Algorithms :68W99 None of the above, but in this sectionMots-clés : fast fourier transform fast matrix multiplication four-color problem maximum independent set quicksort complexity recursive algorithms Index. décimale : 68C Monographie Algorithms and complexity [texte imprimé] / Wilf, Herbert S. . - 2nd ed. . - [S.l.] : A. K. Peters, Ltd, 2002 . - ix - 219 p.
ISBN : 978-1-56881-178-9
Langues : Anglais
Catégories : 68-XX Computer science :68-02 Research exposition (monographs, survey articles)
68-XX Computer science :68QXX Theory of computing:68Q25 Analysis of algorithms and problem complexity
68-XX Computer science :68WXX Algorithms :68W99 None of the above, but in this sectionMots-clés : fast fourier transform fast matrix multiplication four-color problem maximum independent set quicksort complexity recursive algorithms Index. décimale : 68C Monographie Exemplaires
Code-barres Cote Support Localisation Section Disponibilité 16385 68C290 imprimé / autre CRDM 68/INFORMATIQUE Disponible Algorithms in combinatorial geometry / Herbert Edelsbrunner
Titre : Algorithms in combinatorial geometry Type de document : texte imprimé Auteurs : Herbert Edelsbrunner Editeur : Springer-Verlag Année de publication : 1987 Collection : EATCS Monographs on Theoretical Computer Science num. 10 Importance : xv - 423 p. ISBN/ISSN/EAN : 978-3-540-13722-1 Langues : Anglais Catégories : 52-XX Convex and discrete geometry:52-02 Research exposition (monographs, survey articles)
52-XX Convex and discrete geometry:52AXX General convexity:52A35 Helly-type theorems and geometric transversal theory
68-XX Computer science :68QXX Theory of computing:68Q25 Analysis of algorithms and problem complexityMots-clés : voronoi diagrams sorting time-complexity arrangements of hyperplanes in euclidean spaces algorithms in computational geometry combinatorial geometry searching helly theorem radon theorem Index. décimale : 52C Monographie Algorithms in combinatorial geometry [texte imprimé] / Herbert Edelsbrunner . - [S.l.] : Springer-Verlag, 1987 . - xv - 423 p.. - (EATCS Monographs on Theoretical Computer Science; 10) .
ISBN : 978-3-540-13722-1
Langues : Anglais
Catégories : 52-XX Convex and discrete geometry:52-02 Research exposition (monographs, survey articles)
52-XX Convex and discrete geometry:52AXX General convexity:52A35 Helly-type theorems and geometric transversal theory
68-XX Computer science :68QXX Theory of computing:68Q25 Analysis of algorithms and problem complexityMots-clés : voronoi diagrams sorting time-complexity arrangements of hyperplanes in euclidean spaces algorithms in computational geometry combinatorial geometry searching helly theorem radon theorem Index. décimale : 52C Monographie Exemplaires
Code-barres Cote Support Localisation Section Disponibilité 13110 52C27 imprimé / autre CRDM 52/ENSEMBLES CONVEXES, INEGALITES GEOMETRIQUES Disponible Algorithms in real algebraic geometry / Basu, Saugata
Titre : Algorithms in real algebraic geometry Type de document : texte imprimé Auteurs : Basu, Saugata ; Roy, Marie-Françoise ; Richard Pollack Mention d'édition : 2nd ed. Editeur : Springer-Verlag Année de publication : 2006 Collection : Algorithms and Computation in Mathematics num. 10 Importance : ix - 662 p. ISBN/ISSN/EAN : 978-3-540-33098-1 Note générale : commande M. Borer Langues : Anglais Catégories : 03-XX Mathematical logic and foundations:03CXX Model theory:03C10 Quantifier elimination, model completeness and related topics
14-XX Algebraic geometry:14PXX Real algebraic and real analytic geometry:14P10 Semialgebraic sets and related spaces
52-XX Convex and discrete geometry:52CXX Discrete geometry:52C45 Combinatorial complexity of geometric structures
68-XX Computer science :68QXX Theory of computing:68Q25 Analysis of algorithms and problem complexityMots-clés : algorithmic real algebraic geometry complexity of algorithms quantifier elimination real semi-algebraic sets real closed fields Index. décimale : 14C Monographie Algorithms in real algebraic geometry [texte imprimé] / Basu, Saugata ; Roy, Marie-Françoise ; Richard Pollack . - 2nd ed. . - [S.l.] : Springer-Verlag, 2006 . - ix - 662 p.. - (Algorithms and Computation in Mathematics; 10) .
ISBN : 978-3-540-33098-1
commande M. Borer
Langues : Anglais
Catégories : 03-XX Mathematical logic and foundations:03CXX Model theory:03C10 Quantifier elimination, model completeness and related topics
14-XX Algebraic geometry:14PXX Real algebraic and real analytic geometry:14P10 Semialgebraic sets and related spaces
52-XX Convex and discrete geometry:52CXX Discrete geometry:52C45 Combinatorial complexity of geometric structures
68-XX Computer science :68QXX Theory of computing:68Q25 Analysis of algorithms and problem complexityMots-clés : algorithmic real algebraic geometry complexity of algorithms quantifier elimination real semi-algebraic sets real closed fields Index. décimale : 14C Monographie Exemplaires
Code-barres Cote Support Localisation Section Disponibilité 17780 14C263 imprimé / autre CRDM 14/GEOMETRIE ALGEBRIQUE Disponible Combinatorial Optimization / Christos H. Papadimitriou
Titre : Combinatorial Optimization : algorithms and complexity Type de document : texte imprimé Auteurs : Christos H. Papadimitriou ; Steiglitz, K. Mention d'édition : Corr. repr. of the 1982 origina Editeur : Mineola, NY : Dover Année de publication : 1998 Importance : xvi - 496 p. ISBN/ISSN/EAN : 978-0-486-40258-1 Langues : Anglais Catégories : 68-XX Computer science :68QXX Theory of computing:68Q25 Analysis of algorithms and problem complexity
90-XX Operations research, mathematical programming:90-01 Instructional exposition (textbooks, tutorial papers, etc.)
90-XX Operations research, mathematical programming:90CXX Mathematical programming :90C27 Combinatorial optimizationMots-clés : np-completeness integer linear programming branch-and-bound algorithm approximation algorithm spanning tree flow primal-dual algorithm optimization Index. décimale : 90E Combinatorial Optimization : algorithms and complexity [texte imprimé] / Christos H. Papadimitriou ; Steiglitz, K. . - Corr. repr. of the 1982 origina . - Mineola, NY : Dover, 1998 . - xvi - 496 p.
ISBN : 978-0-486-40258-1
Langues : Anglais
Catégories : 68-XX Computer science :68QXX Theory of computing:68Q25 Analysis of algorithms and problem complexity
90-XX Operations research, mathematical programming:90-01 Instructional exposition (textbooks, tutorial papers, etc.)
90-XX Operations research, mathematical programming:90CXX Mathematical programming :90C27 Combinatorial optimizationMots-clés : np-completeness integer linear programming branch-and-bound algorithm approximation algorithm spanning tree flow primal-dual algorithm optimization Index. décimale : 90E Exemplaires
Code-barres Cote Support Localisation Section Disponibilité 16283 90E66 imprimé / autre CRDM 90/ECONOMIE, RECHERCHE OPERATIONNELLE, PROGRAMMATION ET JEUX Disponible Constraint processing / Dechter, Rina
PermalinkFast algorithms for digital signal processing / R. E. Blahut
Permalinka General theory of optimal algorithms / Traub, J. F.
PermalinkGeometric algorithms and combinatorial optimization / Grötschel, Martin
PermalinkIntroduction to Algorithms / Cormen, Thomas H.
PermalinkJournées algorithmiques
PermalinkMathematics and computer science / Gardy, Daniele ; Abdelkader Mokkadem
PermalinkPi and the agm / Jonathan M. Borwein
PermalinkQuicksort / Robert Sedgewick
Permalinkla Reconnaissance des formes par algorithmes / Simon, Jean-Claude
Permalink