{"title":"The VLSI complexity of Boolean functions","authors":"M. Kramer, J. Leeuwen","doi":"10.1007/3-540-13331-3_55","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"107 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Logic and Machines","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/3-540-13331-3_55","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}