On a~class of bases for Boolean functions
    
    
  
  
  
      
      
      
        
Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part XI, Tome 358 (2008), pp. 271-281
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			We prove that up to congruence there exist exactly fourty-four primitive bases of Boolean functions. We also apply our results in order to improve an algorithm of finding maximal strong depth of a Boolean function. Bibl. – 4 titles.
			
            
            
            
          
        
      @article{ZNSL_2008_358_a13,
     author = {D. Skordev},
     title = {On a~class of bases for {Boolean} functions},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {271--281},
     publisher = {mathdoc},
     volume = {358},
     year = {2008},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2008_358_a13/}
}
                      
                      
                    D. Skordev. On a~class of bases for Boolean functions. Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part XI, Tome 358 (2008), pp. 271-281. http://geodesic.mathdoc.fr/item/ZNSL_2008_358_a13/