Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Combinatorics of partially ordered sets"”.

  1. Extremal Combinatorics and Universal Algorithms

    … combinatorial problems in different areas of mathematics: automata theory, combinatorics of partially ordered sets and extremal combinatorics. Firstly, we focus on some new automata that do not seem to have occurred much in the literature, that of solvability of mazes. For our model, a maze …

    cambridge Repository record for Extremal Combinatorics and Universal Algorithms (opens in a new tab)