scientific article
From MaRDI portal
Publication:3005905
zbMath1216.94070MaRDI QIDQ3005905
Sergej A. Ložkin, A. E. Shiganov
Publication date: 10 June 2011
Full work available at URL: http://iospress.metapress.com/content/c252504n50245270/fulltext.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items (4)
A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams ⋮ On the synthesis of oriented contact circuits with certain restrictions on adjacent contacts ⋮ Синтез асимптотически оптимальных по сложности схем из функциональных элементов, защищенных от раскрытия функциональности ⋮ Refined bounds on Shannon's function for complexity of circuits of functional elements
This page was built for publication:
