840 search results - page 28 / 168 » The Complexity of the Extended GCD Problem |
VMCAI
2005
Springer
14 years 1 months ago
2005
Springer
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
EAGC
2004
Springer
14 years 1 months ago
2004
Springer
AS complexity of computational applications and their environments has been increased due to the heterogeneity of resources; complexity, continuous changes of the applications as w...
IJCAI
2003
13 years 9 months ago
2003
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (...
MST
2007
13 years 7 months ago
2007
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...