13603 search results - page 53 / 2721 » On the Computational Complexity of Cut-Reduction |
134
click to vote
CCA
2009
Springer
16 years 9 days ago
2009
Springer
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
106
Voted
CIE
2010
Springer
15 years 10 months ago
2010
Springer
119
Voted
GECCO
2007
Springer
15 years 12 months ago
2007
Springer
167
click to vote
FOCS
1991
IEEE
15 years 9 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...