Pages that link to "Item:Q1318766"
From MaRDI portal
The following pages link to Size-depth tradeoffs for Boolean formulae (Q1318766):
Displaying 16 items.
- A note on the size of prenex normal forms (Q269710) (← links)
- A generalization of Spira's theorem and circuits with small segregators or separators (Q342721) (← links)
- On the applicability of Post's lattice (Q436335) (← links)
- Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity (Q1616616) (← links)
- On the efficiency of normal form systems for representing Boolean functions (Q1989340) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication (Q2691578) (← links)
- A Generalization of Spira’s Theorem and Circuits with Small Segregators or Separators (Q2891374) (← links)
- Span-program-based quantum algorithm for evaluating formulas (Q2913813) (← links)
- Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation (Q2968148) (← links)
- Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)
- (Q5002674) (← links)
- A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas (Q5002707) (← links)
- (Q5381121) (← links)
- (Q5874553) (← links)
- Branching program size is almost linear in formula size (Q5956012) (← links)
