On a relation between the depth and complexity of monotone Boolean formulas
From MaRDI portal
Publication:5090140
DOI10.33048/daio.2019.26.643zbMath1492.94258OpenAlexW4240586718MaRDI QIDQ5090140
Publication date: 15 July 2022
Published in: Diskretnyi analiz i issledovanie operatsii (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/da939
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Depth and polynomial equivalence of formulas for closed classes of two- valued logic
- Size-depth tradeoff in non-monotone Boolean formulae
- The time required to evaluate division-free arithmetic expressions
- Size-depth tradeoff in monotone Boolean formulae
- Parallelizable algebras
- On the depth complexity of formulas
- Efficient Parallel Evaluation of Boolean Expressions
- Restructuring of Arithmetic Expressions For Parallel Evaluation
- On the Parallel Evaluation of Boolean Expressions
- Reduction of Depth of Boolean Networks with a Fan-In Constraint
- The Parallel Evaluation of General Arithmetic Expressions
- The Parallel Evaluation of Arithmetic Expressions Without Division
This page was built for publication: On a relation between the depth and complexity of monotone Boolean formulas
