Books on the topic 'Algorithmic and combinatorics of monoids'

To see the other types of publications on this topic, follow the link: Algorithmic and combinatorics of monoids.

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 28 books for your research on the topic 'Algorithmic and combinatorics of monoids.'

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.

1

Lladser, Manuel E., Robert S. Maier, Marni Mishna, and Andrew Rechnitzer, eds. Algorithmic Probability and Combinatorics. Providence, Rhode Island: American Mathematical Society, 2010. http://dx.doi.org/10.1090/conm/520.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Melczer, Stephen. Algorithmic and Symbolic Combinatorics. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67080-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Can, Mahir, Zhenheng Li, Benjamin Steinberg, and Qiang Wang, eds. Algebraic Monoids, Group Embeddings, and Algebraic Combinatorics. New York, NY: Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4939-0938-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pillwein, Veronika, and Carsten Schneider, eds. Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44559-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Klin, Mikhail, Gareth A. Jones, Aleksandar Jurišić, Mikhail Muzychuk, and Ilia Ponomarenko, eds. Algorithmic Algebraic Combinatorics and Gröbner Bases. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01960-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Algorithmic algebraic combinatorics and Gröbner bases. Heidelberg: Springer, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Calude, Cristian S. Information and Randomness: An Algorithmic Perspective. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Habib, Michel. Probabilistic Methods for Algorithmic Discrete Mathematics. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Longueville, Mark. A Course in Topological Combinatorics. New York, NY: Springer New York, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Linda, Pagli, and Steel Graham 1977-, eds. Mathematical and algorithmic foundations of the internet. Boca Raton, Fla: Chapman & Hall/CRC Press, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
11

Nonlinear discrete optimization: An algorithmic theory. Zürich, Switzerland: European Mathematical Society Publishing House, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
12

Colored operads. Providence, Rhode Island: American Mathematical Society, 2016.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
13

Algebraic Monoids, Group Embeddings, and Algebraic Combinatorics. Springer, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
14

Wang, Qiang, Benjamin Steinberg, Mahir Can, and Zhenheng Li. Algebraic Monoids, Group Embeddings, and Algebraic Combinatorics. Springer London, Limited, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
15

Wang, Qiang, Benjamin Steinberg, Mahir Can, and Zhenheng Li. Algebraic Monoids, Group Embeddings, and Algebraic Combinatorics. Springer, 2016.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
16

Algorithmic Combinatorics on Partial Words. Chapman & Hall/CRC, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
17

Blanchet-Sadri, Francine. Algorithmic Combinatorics on Partial Words. Taylor & Francis Group, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
18

Blanchet-Sadri, Francine. Algorithmic Combinatorics on Partial Words. Taylor & Francis Group, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
19

Blanchet-Sadri, Francine. Algorithmic Combinatorics on Partial Words. Taylor & Francis Group, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
20

Blanchet-Sadri, Francine. Algorithmic Combinatorics on Partial Words. Taylor & Francis Group, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
21

Jones, Gareth A., Mikhail Klin, Ilia Ponomarenko, Aleksandar Jurisic, and Mikhail Muzychuk. Algorithmic Algebraic Combinatorics and Gröbner Bases. Springer, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
22

Algorithmic Algebraic Combinatorics and Gröbner Bases. Springer, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
23

Melczer, Stephen. Algorithmic and Symbolic Combinatorics: An Invitation to Analytic Combinatorics in Several Variables. Springer International Publishing AG, 2020.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
24

Schneider, Carsten, and Veronika Pillwein. Algorithmic Combinatorics : Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on His 60th Birthday. Springer International Publishing AG, 2021.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
25

Schneider, Carsten, and Veronika Pillwein. Algorithmic Combinatorics : Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday. Springer, 2020.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
26

Algorithmic Probability And Combinatorics Ams Special Sessions On Algorithmic Probability And Combinatorics October 56 2007 Depaul University Chicago Illinois Ams Special Session October 45 2008 University Of British Columbia Vancouver Bc Canada. American Mathematical Society(RI), 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
27

Kolmogorov Complexity and Algorithmic Randomness. American Mathematical Society, 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
28

Downey, Rod, and Noam Greenberg. A Hierarchy of Turing Degrees. Princeton University Press, 2020. http://dx.doi.org/10.23943/princeton/9780691199665.001.0001.

Full text
Abstract:
Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications in topology, group theory, and other subfields. This book introduces a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. The book presents numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers. Blending traditional and modern research results in computability theory, the book establishes novel directions in the field.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography