1 paper · 1 filter
Florent Ferrari, Emmanuel Hainry, Romain Péchoux +1
Polylogarithmic time delineates a relevant notion of feasibility on several classical computational models such as Boolean circuits or parallel random access machines. As far as th…