On a relation between the depth and complexity of monotone Boolean formulas (Q5090140): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4240586718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3604270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth and polynomial equivalence of formulas for closed classes of two- valued logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3905209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3674553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parallel Evaluation of Boolean Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Evaluation of Arithmetic Expressions Without Division / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-depth tradeoff in monotone Boolean formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-depth tradeoff in non-monotone Boolean formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restructuring of Arithmetic Expressions For Parallel Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The time required to evaluate division-free arithmetic expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Evaluation of Boolean Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of Depth of Boolean Networks with a Fan-In Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelizable algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the depth complexity of formulas / rank
 
Normal rank

Latest revision as of 16:13, 29 July 2024

scientific article; zbMATH DE number 7558103
Language Label Description Also known as
English
On a relation between the depth and complexity of monotone Boolean formulas
scientific article; zbMATH DE number 7558103

    Statements

    On a relation between the depth and complexity of monotone Boolean formulas (English)
    0 references
    15 July 2022
    0 references
    Boolean formula
    0 references
    depth
    0 references
    complexity
    0 references
    monotone function
    0 references
    0 references

    Identifiers