Sciweavers

680 search results - page 37 / 136
» Complexity of Strict Implication
Sort
View
COMPLEXITY
2006
144views more  COMPLEXITY 2006»
13 years 7 months ago
BML revisited: Statistical physics, computer simulation, and probability
Statistical physics, computer simulation and discrete mathematics are intimately related through the study of shared lattice models. These models lie at the foundation of all thre...
Raissa M. D'Souza
ECTEL
2006
Springer
13 years 11 months ago
Is There a Way to e-Bologna? Cross-National Collaborative Activities in University Courses
This article describes a study of distance collaborative activities that have been conducted in a cross-national setting between a Greek and a German university. We discuss issues ...
Andreas Harrer, Georgios Kahrimanis, Sam Zeini, La...
STOC
2002
ACM
101views Algorithms» more  STOC 2002»
14 years 8 months ago
Size space tradeoffs for resolution
We investigate tradeoffs of various basic complexity measures such as size, space and width. We show examples of formulas that have optimal proofs with respect to any one of these...
Eli Ben-Sasson
COMPGEOM
2006
ACM
14 years 1 months ago
On overlays and minimization diagrams
The overlay of 2 ≤ m ≤ d minimization diagrams of n surfaces in Rd is isomorphic to a substructure of a suitably constructed minimization diagram of mn surfaces in Rd+m−1 . ...
Vladlen Koltun, Micha Sharir
DAM
2008
61views more  DAM 2008»
13 years 7 months ago
Scheduling malleable tasks with interdependent processing rates: Comments and observations
In this short paper we examine the problem of scheduling malleable tasks on parallel processors. One of the main aims of the paper is to present a simple complexity interpretation...
Edmund K. Burke, Moshe Dror, James B. Orlin