On the asymptotics of the number of repetition-free Boolean functions in the basis \(\{\&, \vee, \otimes, \neg\}\) (Q1675524): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1515/dma-2017-0006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1971689940 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2748260 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Refined estimates of the number of repetition-free Boolean functions in the full binary basis \(\{\&,\vee,\oplus,-\}\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The asymptotics of the number of repetition-free Boolean functions in the basis B 1 / rank | |||
Normal rank | |||
Latest revision as of 15:33, 14 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the asymptotics of the number of repetition-free Boolean functions in the basis \(\{\&, \vee, \otimes, \neg\}\) |
scientific article |
Statements
On the asymptotics of the number of repetition-free Boolean functions in the basis \(\{\&, \vee, \otimes, \neg\}\) (English)
0 references
2 November 2017
0 references
repetition-free Boolean function
0 references
enumeration
0 references
asymptotics
0 references
