A platform for research: civil engineering, architecture and urbanism
Refined estimates of the number of repetition-free boolean functions in the full binary basis {&, ∨, ⊕, −
Refined estimates of the number of repetition-free boolean functions in the full binary basis {&, ∨, ⊕, −
Refined estimates of the number of repetition-free boolean functions in the full binary basis {&, ∨, ⊕, −
Zubkov, O. V. (author)
MATHEMATICAL NOTES -NEW YORK- C/C OF MATEMATICHESKIE ZAMETIK ; 87 ; 687-699
2010-01-01
13 pages
Article (Journal)
English
DDC:
510
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Asymptotics of the number of repetition-free Boolean functions in the elementary basis
British Library Online Contents | 2007
|Refined Error Estimates for Radial Basis Function Interpolation
British Library Online Contents | 2003
|Binary terms in polynomial representations of Boolean functions
British Library Online Contents | 2007
|Binary terms in polynomial representations of Boolean functions
British Library Online Contents | 2007
|Assessment of Concrete Bridges : Models and Tests for Refined Capacity Estimates
BASE | 2014
|