Sciweavers

13603 search results - page 140 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
COCOON
2003
Springer
15 years 11 months ago
The Complexity of Boolean Matrix Root Computation
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
Martin Kutz
ICS
2010
Tsinghua U.
16 years 3 months ago
Cryptographic Complexity Classes and Computational Intractability Assumptions
Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek
IPPS
2005
IEEE
15 years 11 months ago
On Scheduling Complex Dags for Internet-Based Computing
Grzegorz Malewicz, Arnold L. Rosenberg, Matthew Yu...
WG
2005
Springer
15 years 11 months ago
The Computational Complexity of Delay Management
Michael Gatto, Riko Jacob, Leon Peeters, Anita Sch...