The following pages link to Mikael Goldmann (Q204360):
Displaying 15 items.
- On the power of a threshold gate at the top (Q287188) (← links)
- A note on the power of majority gates and modular gates (Q673905) (← links)
- On the power of small-depth threshold circuits (Q685717) (← links)
- A simple lower bound for monotone clique using a communication game (Q1190521) (← links)
- Majority gates vs. general weighted threshold gates (Q1210330) (← links)
- On average time hierarchies (Q1313704) (← links)
- The complexity of solving equations over finite groups (Q1854566) (← links)
- Monotone Circuits for Connectivity Have Depth (log n)<sup>2-o(1)</sup> (Q4210096) (← links)
- (Q4234106) (← links)
- (Q4364539) (← links)
- Simulating Threshold Circuits by Majority Circuits (Q4388870) (← links)
- (Q4501567) (← links)
- (Q4839053) (← links)
- Simulating threshold circuits by majority circuits (Q5248525) (← links)
- Complexity bounds on general hard-core predicates. (Q5944107) (← links)
