Article thumbnail
Location of Repository

Circuit Complexity and Multiplicative Complexity of Boolean Functions

By Arist Kojevnikov and Alexander S. Kulikov
Publisher: Springer Berlin Heidelberg
Year: 2010
DOI identifier: 10.1007/978-3-642-13962-8_27
OAI identifier:
Provided by: MUCC (Crossref)
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://logic.pdmi.ras.ru/%7Eku... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.