2446 search results - page 162 / 490 » Choiceless Polynomial Time |
134
click to vote
APN
2005
Springer
15 years 10 months ago
2005
Springer
This paper describes the verification module (the VipVerify Module) of the VipTool [4]. VipVerify allows to verify whether a given scenario is an execution of a system model, give...
131
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
138
click to vote
EPIA
2005
Springer
15 years 10 months ago
2005
Springer
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...
140
click to vote
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of rewriting XPath...
115
click to vote
WG
2005
Springer
15 years 9 months ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...