Size-depth tradeoff in non-monotone Boolean formulae (Q1132635): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: Q4190138 / 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: The Parallel Evaluation of Arithmetic Expressions Without Division / 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: Q5585368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effect of the depth of formulas on their complexity / 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: Efficient Parallel Evaluation of Boolean Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4172915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Komplexität von Entscheidungsproblemen. Ein Seminar / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:35, 13 June 2024

scientific article
Language Label Description Also known as
English
Size-depth tradeoff in non-monotone Boolean formulae
scientific article

    Statements

    Size-depth tradeoff in non-monotone Boolean formulae (English)
    0 references
    0 references
    0 references
    0 references
    1980
    0 references
    0 references
    formula size and depth
    0 references
    complexity measures of Boolean functions
    0 references
    logarithmic lower bound on circuit depth
    0 references