Boolean Function Complexity Advances and Frontiers /
Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this “complexity Waterloo” that hav...
        Saved in:
      
    
                  | 主要作者: | Jukna, Stasys. (Author, http://id.loc.gov/vocabulary/relators/aut) | 
|---|---|
| 企业作者: | SpringerLink (Online service) | 
| 格式: | 电子 电子书 | 
| 语言: | English | 
| 出版: | 
      Berlin, Heidelberg :
        Springer Berlin Heidelberg : Imprint: Springer,
    
      2012.
     | 
| 版: | 1st ed. 2012. | 
| 丛编: | Algorithms and Combinatorics,
              27             | 
| 主题: | |
| 在线阅读: | https://doi.org/10.1007/978-3-642-24508-4 | 
| 标签: | 
       添加标签    
     
      没有标签, 成为第一个标记此记录!
    | 
相似书籍
- 
                
        
          Extremal Combinatorics With Applications in Computer Science /        
                  
由: Jukna, Stasys., et al.
出版: (2011) - 
                
        
          Storing and Transmitting Data Rudolf Ahlswede’s Lectures on Information Theory 1 /        
                  
由: Ahlswede, Rudolf., et al.
出版: (2014) - 
                
        
          Transmitting and Gaining Data Rudolf Ahlswede’s Lectures on Information Theory 2 /        
                  
由: Ahlswede, Rudolf., et al.
出版: (2015) - 
                
        
          Channel Coding Techniques for Wireless Communications        
                  
由: Deergha Rao, K., et al.
出版: (2015) - 
                
        
          Wireless Communications        
                          
出版: (2007) 



