scientific article; zbMATH DE number 850402
From MaRDI portal
Publication:4866427
zbMATH Open0848.94029MaRDI QIDQ4866427FDOQ4866427
Authors: A. A. Semenov
Publication date: 31 October 1996
Title of this publication is not available (Why is that?)
Recommendations
Cited In (13)
- Title not available (Why is that?)
- Title not available (Why is that?)
- To the problem of realizability of Boolean functions by circuits in a basis of unreliable functional elements
- The complexity of Boolean function implementation in some classes of automaton circuits
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimum \(\varepsilon\)-equivalent circuit size problem
- On the minimization of complexity and automation of efficient representation of Boolean functions in classes of formulas and circuits
- Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity
- The complexity of the descriptiveness of Boolean circuits over different sets of gates
- Asymptotically best method for synthesis of Boolean recursive circuits
- Succinct functional commitment for a large class of arithmetic circuits
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4866427)