Pages that link to "Item:Q2547883"
From MaRDI portal
The following pages link to Complexity of the realization of a linear function in the class of \(\Pi\)-circuits (Q2547883):
Displayed 16 items.
- A stronger LP bound for formula size lower bounds via clique constraints (Q428879) (← links)
- Interpolants, cut elimination and flow graphs for the propositional calculus (Q674415) (← links)
- An extension of Khrapchenko's theorem (Q753798) (← links)
- New bounds on the half-duplex communication complexity (Q831813) (← links)
- Solution of Rota's problem on the order of series-parallel networks (Q1190152) (← links)
- On almost bad Boolean bases (Q1349706) (← links)
- On the shrinkage exponent for read-once formulae (Q1367534) (← links)
- The average sensitivity of bounded-depth formulas (Q1653335) (← links)
- Circuit complexity of linear functions: gate elimination and feeble security (Q1946842) (← links)
- On the perfectness of minimal regular partitions of the edge set of the $n$-dimensional cube (Q5090139) (← links)
- Cubic Formula Size Lower Bounds Based on Compositions with Majority (Q5090412) (← links)
- Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory (Q5135262) (← links)
- ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO (Q5151450) (← links)
- BREAKING THE RECTANGLE BOUND BARRIER AGAINST FORMULA SIZE LOWER BOUNDS (Q5168421) (← links)
- (Q5227514) (← links)
- (Q5878634) (← links)
