13603 search results - page 49 / 2721 » On the Computational Complexity of Cut-Reduction |
COMPLEXITY
2011
14 years 4 months ago
2011
FOCS
1994
IEEE
15 years 1 months ago
1994
IEEE
This paper concerns the open problem of Lov
136
click to vote
COMPUTING
2011
14 years 4 months ago
2011
Abstract Cloud computing could offer good business models for small CSE (Computational Science and Engineering) research groups because these groups often do not have enough human ...
ICPP
1994
IEEE
15 years 1 months ago
1994
IEEE
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
APAL
2010
14 years 10 months ago
2010
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...