It is not the case that Some barriers (e.g., logarithmic depth for P-complete problems) have conditional lower bounds independent of algorithm discovery rates.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.