13603 search results - page 56 / 2721 » On the Computational Complexity of Cut-Reduction |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
130
click to vote
HPDC
1993
IEEE
1993
IEEE
An Analysis of Distributed Computing Software and Hardware for Applications in Computational Physics
15 years 1 months ago
We have implemented a set of computational physics codes on a network of IBM RS/6000 workstations used as a distributed parallel computer. We compare the performance of the codes ...
CIE
2006
Springer
15 years 1 months ago
2006
Springer
We introduce two hierarchies of unknown ordinal height. The hierarchies are induced by natural fragments of a calculus based on finite types and G
CSCWD
2008
Springer
14 years 11 months ago
2008
Springer
: The complexity of process engineering projects in the chemical industry
STACS
2010
Springer
15 years 1 months ago
2010
Springer
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...