Books on the topic 'Algorithme de groupe'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 books for your research on the topic 'Algorithme de groupe.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse books on a wide variety of disciplines and organise your bibliography correctly.
Borovik, Alexandre V., ed. Groups, Languages, Algorithms. Providence, Rhode Island: American Mathematical Society, 2005. http://dx.doi.org/10.1090/conm/378.
Full textRelatively hyperbolic groups: Intrinsic geometry, algebraic properties, and algorithmic problems. Providence, R.I: American Mathematical Society, 2006.
Find full textButler, Gregory, ed. Fundamental Algorithms for Permutation Groups. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-54955-2.
Full textButler, G. Fundamental algorithms for permutation groups. Berlin: Springer-Verlag, 1992.
Find full textAlexandre, Borovik, ed. Groups, languages, algorithms: AMS-ASL Joint Special Session on Interactions between Logic, Group Theory, and Computer Science, January 16-19, 2003, Baltimore, Maryland. Providence, R.I: American Mathematical Society, 2005.
Find full textDimitrovsky, Isaac. A group lock algorithm, with applications. New York: Courant Institute of Mathematical Sciences, New York University, 1986.
Find full textS, Agaian S., ed. Multidimensional discrete unitary transforms: Representation, partitioning, and algorithms. New York: Marcel Dekker, 2003.
Find full textBirget, Jean-Camille, Stuart Margolis, John Meakin, and Mark Sapir, eds. Algorithmic Problems in Groups and Semigroups. Boston, MA: Birkhäuser Boston, 2000. http://dx.doi.org/10.1007/978-1-4612-1388-8.
Full textBaumslag, Gilbert, and Charles F. Miller, eds. Algorithms and Classification in Combinatorial Group Theory. New York, NY: Springer New York, 1992. http://dx.doi.org/10.1007/978-1-4613-9730-4.
Full textCollins, E. A homotopy algorithm for digital optimal projection control, GASD-HADOC. Melbourne, Fla: Harris Corp., Government Aerospace System Division, 1993.
Find full textApplications of multi-objective evolutionary algorithms. Singapore: World Scientific, 2004.
Find full textSagan, Bruce Eli. The symmetric group: Representations, combinatorial algorithms, and symmetric functions. 2nd ed. New York: Springer, 2001.
Find full textSagan, Bruce Eli. The symmetric group: Representations, combinatorial algorithms, and symmetric functions. New York: Springer, 2000.
Find full textThe symmetric group: Representations, combinatorial algorithms, and symmetric functions. Pacific Grove, Calif: Wadsworth & Brooks/Cole Advanced Books & Software, 1991.
Find full textAramayona, Javier, Volker Diekert, Christopher J. Leininger, Pedro V. Silva, and Armin Weiß. Algorithmic and Geometric Topics Around Free Groups and Automorphisms. Edited by Juan González-Meneses, Martin Lustig, and Enric Ventura. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-60940-9.
Full textYan, Haowen. Description Approaches and Automated Generalization Algorithms for Groups of Map Objects. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-3678-2.
Full textBueso, José. Algorithmic Methods in Non-Commutative Algebra: Applications to Quantum Groups. Dordrecht: Springer Netherlands, 2003.
Find full textVinogradov, A. M. Symmetries of Partial Differential Equations: Conservation Laws - Applications - Algorithms. Dordrecht: Springer Netherlands, 1990.
Find full textMarcus Aurelius Augustinus van Leeuwen. A Robinson-Schensted algorithm in the geometry of flags for classical groups. Utrecht: Rijksuniversiteit te Utrecht, 1989.
Find full textEdmonds, Jeff. How to think about algorithms: Loop invariants and recursion. Cambridge: Cambridge University Press, 2008.
Find full textKahrobaei, Delaram, and Vladimir Shpilrain. Algorithmic problems of group theory, their complexity, and applications to cryptography. Providence, Rhode Island: American Mathematical Society, 2015.
Find full textKahrobaei, Delaram, and Vladimir Shpilrain, eds. Algorithmic Problems of Group Theory, Their Complexity, and Applications to Cryptography. Providence, Rhode Island: American Mathematical Society, 2015. http://dx.doi.org/10.1090/conm/633.
Full textZeng, Wei. Ricci flow for shape analysis and surface registration: Theories, algorithms and applications. New York: Springer, 2013.
Find full textGurwitz, C. A globally convergent algorithm for minimizing over the rotation group of quadratic forms. New York: Courant Institute of Mathematical Sciences, New York University, 1987.
Find full textRosenberger, Gerhard, Ulrich Hertrampf, and Manfred Kufleitner. Discrete Algebraic Methods: Arithmetic, Cryptography, Automata and Groups. Berlin: De Gruyter, 2016.
Find full textTawarmalani, Mohit. Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications. Boston, MA: Springer US, 2002.
Find full textNorman, Christopher. Finitely Generated Abelian Groups and Similarity of Matrices over a Field. London: Springer London, 2012.
Find full textBrimkov, Valentin E. Digital Geometry Algorithms: Theoretical Foundations and Applications to Computational Imaging. Dordrecht: Springer Netherlands, 2012.
Find full textShin-ichi, Nakano, and SpringerLink (Online service), eds. WALCOM: Algorithms and Computation: 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.
Find full textservice), SpringerLink (Online, ed. Perspectives on Projective Geometry: A Guided Tour Through Real and Complex Geometry. Berlin, Heidelberg: Springer-Verlag Berlin Heidelberg, 2011.
Find full textMyasnikov, Alexei G. Non-commutative cryptography and complexity of group-theoretic problems. Providence, R.I: American Mathematical Society, 2011.
Find full textZbigniew, Hajto, ed. Algebraic groups and differential Galois theory. Providence, R.I: American Mathematical Society, 2011.
Find full textauthor, Sarich Marco 1985, ed. Metastability and Markov state models in molecular dynamics: Modeling, analysis, algorithmic approaches. Providence, Rhode Island: American Mathematical Society, 2013.
Find full text(Editor), Jean-Camille Birget, Stuart Margolis (Editor), John Meakin (Editor), and Mark Sapir (Editor), eds. Algorithmic Problems in Groups and Semigroups (Trends in Mathematics). Birkhäuser Boston, 1999.
Find full textClassification Algorithms for Codes and Designs (Algorithms and Computation in Mathematics). Springer, 2005.
Find full textSmarandache, Florentin, and Said Broumi. Neutrosophic Graph Theory and Algorithms. IGI Global, 2019.
Find full textSmarandache, Florentin. Neutrosophic Graph Theory and Algorithms. IGI Global, 2020.
Find full textSmarandache, Florentin, and Said Broumi. Neutrosophic Graph Theory and Algorithms. IGI Global, 2019.
Find full textKant, Tanya. Making it Personal. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780190905088.001.0001.
Full textKaski, Petteri, and Patric R. J. Östergård. Classification Algorithms for Codes and Designs. Springer, 2014.
Find full textBirget, Jean-Camille, Stuart Margolis, and John Meakin. Algorithmic Problems in Groups and Semigroups. Springer, 2012.
Find full textGilbert, Baumslag, Miller C. F. 1941-, Mathematical Sciences Research Institute (Berkeley, Calif.), and Workshop on Algorithms, Word Problems, and Classification in Combinatorial Group Theory (1989 : Mathematical Sciences Research Institute), eds. Algorithms and classification in combinatorial group theory. New York: Springer-Verlag, 1992.
Find full text