13603 search results - page 100 / 2721 » On the Computational Complexity of Cut-Reduction |
163
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper describes PI/OT, a template-based parallel I/O system. In PI/OT, I/O streams have annotations associated with them that are external to the source code. These annotatio...
150
click to vote
LATIN
1998
Springer
15 years 10 months ago
1998
Springer
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
161
click to vote
MFCS
1997
Springer
15 years 10 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
200
Voted
STACS
1994
Springer
15 years 10 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
167
click to vote
CONEXT
2007
ACM
15 years 10 months ago
2007
ACM
Protocol extensions for a mobile Internet have been developed within the IETF, but a standard design of mobile multicast is still awaited. Multicast routing, when adapting its dis...