You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
A 5n − o(n) Lower Bound on the Circuit Size over U 2 of a Linear Boolean Function
How the World Computes
Lecture notes in computer science, June 2012
Alexander S. Kulikov, Olga Melanich, Ivan Mihajlin
S. Barry Cooper, Anuj Dawar, Benedikt Löwe
The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.
|Readers by professional status||Count||As %|
|Student > Master||2||67%|
|Readers by discipline||Count||As %|