ASUNAM
2011
IEEE
13 years 21 days ago
2011
IEEE
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Computation plays a major role in decision making. Even if an agent is willing to ascribe a probability to all states and a utility to all outcomes, and maximize expected utility,...
APAL
2006
14 years 24 days ago
2006
Parameterized complexity has, so far, been largely con ned to consideration of computational problems as decision or search problems. However, it is becoming evident that the param...
PKC
2001
Springer
14 years 5 months ago
2001
Springer
This paper introduces a novel class of computational problems, the gap problems, which can be considered as a dual to the class of the decision problems. We show the relationship a...
KR
2010
Springer
14 years 5 months ago
2010
Springer
Computation plays a major role in decision making. Even if an agent is willing to ascribe a probability to all states and a utility to all outcomes, and maximize expected utility,...
ICALP
2003
Springer
14 years 6 months ago
2003
Springer
We describe several computational problems on prediction and design of RNA molecules.
SETA
2004
Springer
14 years 6 months ago
2004
Springer
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...