Výsledky vyhledávání - "Boolean function complexity theory"

The complexity of the parity function in unbounded fan-in, unbounded depth circuits

Autoři: Ingo Wegener

Zdroj: Theoretical Computer Science. 85:155-170

Témata: unbounded fan-in Boolean circuits, Analysis of algorithms and problem complexity, Switching theory, application of Boolean algebra, Boolean functions, Boolean function complexity theory, 0102 computer and information sciences, complexity measure, 0101 mathematics, 01 natural sciences, complexity of the parity function, Theoretical Computer Science, Computer Science(all)

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/33394
https://doi.org/10.1016/0304-3975(91)90052-4
https://dblp.uni-trier.de/db/journals/tcs/tcs85.html#Wegener91
https://www.sciencedirect.com/science/article/abs/pii/0304397591900524
https://www.sciencedirect.com/science/article/pii/0304397591900524
https://core.ac.uk/display/82172673

Counting the Number of Perfect Matchings, and Generalized Decision Trees.

Autoři: Vyalyi, M. N.

Zdroj: Problems of Information Transmission; Apr2021, Vol. 57 Issue 2, p143-160, 18p

Témata: DECISION trees, SPARSE graphs, COUNTING, ALGORITHMS, GENERALIZATION

On complexity of realization of some systems of functions of logic algebra by contact and generalized contact networks

Autoři: Lozhkin, S. A. Koshkin, M. A.

Témata: monotone functions, Analysis of algorithms and problem complexity, Switching theory, application of Boolean algebra, Boolean functions, contact schemes, complexity, switching circuits, dual functions

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/23021

Complexity of realization of symmetric Boolean functions by switching circuits

Autoři: Grinchuk, M. I.

Témata: Analysis of algorithms and problem complexity, Switching theory, application of Boolean algebra, Boolean functions, contact schemes, symmetric Boolean functions, complexity, switching circuits

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/23013

Computing and Combinatorics : 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings

Autoři: Yixin Cao Jianer Chen

Resource Type: eBook.

Témata: Algorithms, Computer science—Mathematics, Discrete mathematics, Numerical analysis, Artificial intelligence—Data processing, Social sciences—Data processing, Application software

Categories: COMPUTERS / Programming / Algorithms, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Business & Productivity Software / General, COMPUTERS / Computer Science, COMPUTERS / Database Administration & Management, MATHEMATICS / Discrete Mathematics, MATHEMATICS / Numerical Analysis

Communication Complexity and Parallel Computing

Autoři: Juraj Hromkovič

Resource Type: eBook.

Témata: Parallel processing (Electronic computers), Computational complexity

Categories: COMPUTERS / Computer Architecture, COMPUTERS / Computer Science, COMPUTERS / Data Transmission Systems / Electronic Data Interchange, COMPUTERS / Networking / General, COMPUTERS / Hardware / General, TECHNOLOGY & ENGINEERING / Telecommunications