Documents liés : [31 document(s)]

Documents (Mots clés)

• [MathOuvrage] Introduction to computational science / Shiflet, Angela B. ; Shiflet, George W.. -Princeton NJ : Princeton university Press, 2014. - xxxiii, 816 p. ; 26 cm
  ISBN 9780691160719
  http://wofford-ecs.org/IntroComputationalScience/index.htm
  
• [MathOuvrage] Logical foundations of mathematics and computational complexity / Pudlák, Pavel. -Cham : Springer, 2013. - xiv, 695 p. ; 24 cm
  ISBN 9783319001180
  https://link.springer.com/bookseries/3733
  
• [MathOuvrage] Efficient numerical methods for non-local operators / Börm, Steffen. -Zürich : European mathematical Society, 2010. - ix, 432 p. ; 26 cm
  ISBN 9783037190913
  https://ems.press/books/etm
  
• [MathOuvrage] Computational complexity / Arora, Sanjeev ; Barak, Boaz. -Cambridge : Cambridge university Press, 2009. - xxiii, 579 p. ; 26 cm
  ISBN 9780521424264
  
• [MathOuvrage] An Introduction to Kolmogorov complexity and its applications / Li, Ming ; Vitanyi, Paul. -New York NY : Springer, 2008. - xxiii, 790 p. ; 25 cm
  ISBN 9780387339986
  http://link.springer.com.scd-rproxy.u-strasbg.fr/bookseries/3191
  
• [MathOuvrage] Finite ordered sets / Caspard, Nathalie ; Leclerc, Bruno ; Monjardet, Bernard. -Cambridge : Cambridge university Press, 2012. - xi, 337 p. ; 24 cm
  ISBN 9781107013698
  
• [MathOuvrage] The Nature of computation / Moore, Cristopher ; Mertens, Stephan. -Oxford : Oxford university Press, 2011. - xvii, 985 p. ; 26 cm
  ISBN 9780199233212
  
• [MathOuvrage] A Primer on pseudorandom generators / Goldreich, Oded. -Providence RI : American mathematical Society, 2010. - x, 114 p. ; 26 cm
  ISBN 9780821851920
  
• [MathOuvrage] Algebra, arithmetic, and geometry: in honor of Yu. I. Manin. Vol. I / Dédic. Manin, Yuri I. ; Ed. Tschinkel, Yuri ; Ed. Zarkhin, Yuri G.. -Boston MA : Birkhäuser, 2010. - xxxiv, 698 p. ; 24 cm
  ISBN 9780817647445
  https://link-springer-com.scd-rproxy.u-strasbg.fr/book/10.1007/978-0-8176-4745-2
  
• [MathOuvrage] Group-based cryptography / Myasnikov, Alexei G. ; Shpilrain, Vladimir ; Ushakov, Alexander. -Basel : Birkhäuser, 2008. - xv, 183 p. ; 24 cm
  ISBN 9783764388263
  https://link-springer-com.scd-rproxy.u-strasbg.fr/book/10.1007/978-3-7643-8827-0
  
• [MathOuvrage] Algorithms in real algebraic geometry / Basu, Saugata ; Pollack, Richard ; Roy, Marie-Françoise. -Berlin : Springer, 2006. - ix, 662 p. ; 24 cm
  ISBN 9783540330981
  https://link-springer-com.scd-rproxy.u-strasbg.fr/openurl.asp?genre=journal&issn=1431-1550
  
• [MathOuvrage] Cryptography and complexity / Talbot, John ; Welsh, Dominic. -Cambridge : Cambridge university Press, 2005. - xii, 292 p. ; 24 cm
  ISBN 9780521852319
  
• [MathCongrès] Surveys in modern mathematics / Ed. Prasolov, Viktor V. ; Ed. Il'yashenko, Yu. S.. -Cambridge : Cambridge university Press, 2005. - xi, 348 p. ; 23 cm
  ISBN 9780521547932
  
• [MathOuvrage] Cours et exercices d'informatique / Coord. Albert, Luc ; Gastin, Paul ; Petazzoni, Bruno ; Petit, Antoine ; et al.. -Paris : Vuibert, 1998. - xvii, 434 p. ; 24 cm
  ISBN 9782711786213
  
• [MathOuvrage] Solving polynomial equation systems II / Mora, Teo. -Cambridge : Cambridge university Press, 2005. - xxii, 759 p. ; 24 cm
  ISBN 9780521811569
  
• [MathOuvrage] Algorithms in real algebraic geometry / Basu, Saugata ; Pollack, Richard ; Roy, Marie-Françoise. -Berlin : Springer, 2003. - viii, 602 p. ; 24 cm
  ISBN 9783540009733
  https://link.springer.com/openurl.asp?genre=journal&issn=1431-1550
  
• [MathOuvrage] Theory of semi-feasible algorithms / Hemaspaandra, Lane A. ; Torenvliet, Leen. -Berlin, Heidelberg, New York NY : Springer, 2003. - x, 148 p. ; 24 cm
  
• [MathOuvrage] Mathematical logic and algebra / Ed. Adian, Sergei I. ; Ed. Nikitin, Ivan P. ; Steklov Institute of mathematics. -Moscow : Maik Nauka;Interperiodica publishing, 2003. - 196 p. ; 28 cm
  
• [MathOuvrage] Programmation linéaire, complexité / Maurras, Jean François. -Berlin, Heidelberg, Paris : Springer, 2002. - xiv, 221 p. ; 24 cm
  
• [MathCongrès] Kolmogorov complexity and computational complexity / Ed. Watanabe, Osamu. -Berlin, Heidelberg, New York NY : Springer, 1992. - 105 p. ; 24 cm
  https://link.springer.com/bookseries/776
  
• [MathOuvrage] An Introduction to Kolmogorov complexity and its applications / Li, Ming ; Vitanyi, Paul. -New York NY : Springer, 1997. - xx, 637 p. ; 24 cm
  
• [MathOuvrage] Combinatorial optimization / Korte, Bernhard ; Vygen, Jens. -Berlin, Heidelberg, New York NY : Springer, 2002. - xiii, 530 p. ; 25 cm
  https://link.springer.com/bookseries/13
  
• [MathOuvrage] Communication complexity / Kushilevitz, Eyal ; Nisan, Noam. -Cambridge : Cambridge university Press, 1997. - xiii, 189 p. ; 23 cm
  
• [MathOuvrage] Composition de polytopes combinatoires / Margot, François. -Lausanne : Presses polytechniques et universitaires romandes, 1995. - 176 p. ; 21 cm
  
• [MathOuvrage] Combinatorial optimization / Korte, Bernhard ; Vygen, Jens. -Berlin, Heidelberg, New York NY : Springer, 2000. - xi, 530 p. ; 25 cm
  https://link.springer.com/bookseries/13
  
• [MathOuvrage] Complexity and approximation / Ausiello, Giorgio ; Crescenzi, P. ; Gambosi, G. ; Kann, V. ; et al.. -Berlin, Heidelberg, New York NY : Springer, 1999. - xix, 524 p. ; 25 cm
  
• [MathOuvrage] Pseudorandomness and cryptographic applications / Luby, Michael. -Princeton NJ : Princeton university Press, 1996. - xvi, 234 p. ; 23 cm
  
• [MathOuvrage] Arithmetic, proof theory, and computational complexity / Ed. Clote, Peter ; Ed. Krajicek, Jan. -Oxford : Clarendon Press, 1993. - xii, 428 p. ; 24 cm
  
• [MathOuvrage] Algebraic systems of equations and computational complexity theory / Wang, Zeke ; Xu, Senlin ; Gao, Tangan. -Beijing, Dordrecht : Science press;Kluwer Academic Publishers, 1994. - vi, 243 p. ; 25 cm
  https://link.springer.com/bookseries/6243
  
• [MathCongrès] Séminaire de complexité algorithmique et de logique / Ed. Michel, P.-H. ; Ed. Ressayre, J.-P.. -Paris : Université Paris VII, 1989. - 100 p. ; 23 cm
  
• [MathCongrès] Algorithmes et complexité / Ed. Stern, J.. -Caen : Université de Caen, 1982. - 236 p. ; 30 cm