Pages that link to "Item:Q1182033"

The following pages link to A computation of the eighth Dedekind number (Q1182033):

Displaying 29 items.

• A multi-tree committee to assist port-of-entry inspection decisions (Q323142) (← links)
• Counterexamples to conjectures about subset takeaway and counting linear extensions of a Boolean lattice (Q722587) (← links)
• Enumerating orientations of the free spikes (Q872046) (← links)
• Counting combinatorial choice rules (Q876881) (← links)
• The order dimension of the complete graph (Q1301733) (← links)
• A map from the lower-half of the \(n\)-cube onto the \((n-1)\)-cube which preserves intersecting antichains (Q1304483) (← links)
• Optimal resource allocation enables mathematical exploration of microbial metabolic configurations (Q1679003) (← links)
• There are more strategy-proof procedures than you think (Q1758194) (← links)
• Computers and universal algebra: Some directions (Q1902542) (← links)
• General theory for interactions in sufficient cause models with dichotomous exposures (Q1940768) (← links)
• Counting families of mutually intersecting sets (Q1953483) (← links)
• The central decomposition of \(FD_{01}(n)\) (Q2160016) (← links)
• Free monoids and generalized metric spaces (Q2311378) (← links)
• Counting inequivalent monotone Boolean functions. (Q2440095) (← links)
• Identification of fuzzy measures from sample data with genetic algorithms (Q2489140) (← links)
• Some combinatorics of imperfect information (Q2747710) (← links)
• On the inverse power index problem (Q3165908) (← links)
• Injective envelopes of transition systems and Ferrers languages (Q3298124) (← links)
• The Polytope of Fuzzy Measures and Its Adjacency Graph (Q3540942) (← links)
• (Q4639886) (← links)
• (Q4989361) (← links)
• (Q5026931) (← links)
• (Q5043579) (← links)
• (Q5060306) (← links)
• The Number of Star Operations on Numerical Semigroups and on Related Integral Domains (Q5115902) (← links)
• Adinkras for mathematicians (Q5420116) (← links)
• On the number of maximal antichains in Boolean lattices for \(n\) up to 7 (Q6040344) (← links)
• Speedup the optimization of maximal closure of a node-weighted directed acyclic graph (Q6105899) (← links)
• A computation of the ninth Dedekind number (Q6671792) (← links)