937 search results - page 43 / 188 » On the Complexity of Partial Order Properties |
140
click to vote
CSL
2001
Springer
15 years 10 months ago
2001
Springer
We show in this paper a special extended logic, partition logic based on so called partition quantifiers, is able to capture some important complexity classes NP, P and NL by its ...
187
click to vote
COCOA
2010
Springer
15 years 28 days ago
2010
Springer
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model...
153
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...
170
click to vote
AICOM
2005
15 years 5 months ago
2005
Abstract. Simulating and controlling physiological phenomena are complex tasks to tackle. This is due to the fact that physiological processes are usually described by a set of par...
145
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...