Change language
English Deutsch
Change currency
€ EUR £ GBP $ USD
Licensed Unlicensed Requires Authentication Published by De Gruyter October 9, 2009

Fast enumeration of combinatorial objects

  • B. YA. RYABKO
From the journal Discrete Mathematics and Applications
https://doi.org/10.1515/dma.1998.8.2.163
Published Online: 2009-10-09
Published in Print: 1998

Walter de Gruyter

From the journal
Discrete Mathematics and Applications
Discrete Mathematics and Applications
Volume 8 Issue 2

Journal and Issue

Articles in the same Issue

Titelei
The number of q-ary words with restrictions on the length of the maximal run
Inequalities for the number of high probability outcomes in the polynomial scheme
Subliminal channels and information security in Computer Systems
On the radii of steadiness, quasi-steadiness, and stability of a vector trajectory problem on lexicographic optimization
On maximal t-packings of the complete multipartite graph
On the number of Solutions of a Diophantine equation of Frobenius
Fast enumeration of combinatorial objects
Operators over relations preserving transitivity
On discrete sublinear and superlinear operators
Downloaded on 6.6.2024 from https://www.degruyter.com/document/doi/10.1515/dma.1998.8.2.163/html
Scroll to top button