scientific article; zbMATH DE number 2047435

zbMATH Open1032.05006MaRDI QIDQ4451581FDOQ4451581

Authors: Aleksej Dmitrievich Korshunov 

Publication date: 29 February 2004

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 2239573
• The number of \(k\)-undivided families of subsets of an \(n\)-element set (\(k\)-undivided Boolean functions of \(n\)-variables). III. The case when \(n\) is arbitrary and \(k\geq 3\)
• Lower bounds for a number of \((k,r)\)-undivided families of subsets of an \(n\)-element set (\((k,r)\)-undivided Boolean functions)
• scientific article; zbMATH DE number 736301
• scientific article; zbMATH DE number 1234611

zbMATH Keywords

two-valued functionasymptotic expressionPost class

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Other combinatorial set theory (03E05) Boolean functions (06E30)

Cited In (5)

• The number of \(k\)-undivided families of subsets of an \(n\)-element set (\(k\)-undivided Boolean functions of \(n\)-variables). III. The case when \(n\) is arbitrary and \(k\geq 3\)
• Title not available (Why is that?)
• Lower bounds for a number of \((k,r)\)-undivided families of subsets of an \(n\)-element set (\((k,r)\)-undivided Boolean functions)
• Maximal \(k\)-intersecting families of subsets and Boolean functions
• The number of k‐SAT functions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4451581)