Pages that link to "Item:Q444909"
From MaRDI portal
The following pages link to Algorithms for combinatorial structures: well-founded systems and Newton iterations (Q444909):
Displaying 11 items.
- Free integro-differential algebras and Gröbner-Shirshov bases. (Q493010) (← links)
- An algorithm computing combinatorial specifications of permutation classes (Q526814) (← links)
- Counting and generating permutations in regular classes (Q727971) (← links)
- Convergence of Newton's method over commutative semirings (Q899320) (← links)
- On the number of unary-binary tree-like structures with restrictions on the unary height (Q1745901) (← links)
- A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space (Q2120961) (← links)
- Statistical properties of lambda terms (Q2327214) (← links)
- On the number of planar Eulerian orientations (Q2400972) (← links)
- Recursive Combinatorial Structures: Enumeration, Probabilistic Analysis and Random Generation (Q3304095) (← links)
- Exact-Size Sampling of Enriched Trees in Linear Time (Q6057780) (← links)
- Simplifications of Uniform Expressions Specified by Systems (Q6169899) (← links)
