Sciweavers

1262 search results - page 138 / 253
» Diagnosis Problem Solving Using Fuzzy Relations
Sort
View
135
Voted
CAV
2003
Springer
160views Hardware» more  CAV 2003»
15 years 8 months ago
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
Jan Obdrzálek
IMA
2003
Springer
125views Cryptology» more  IMA 2003»
15 years 8 months ago
Commitment Capacity of Discrete Memoryless Channels
In extension of the bit commitment task and following work initiated by Crépeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discr...
Andreas Winter, Anderson C. A. Nascimento, Hideki ...
MFCS
2001
Springer
15 years 7 months ago
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
Erik D. Demaine
CIE
2006
Springer
15 years 6 months ago
On Graph Isomorphism for Restricted Graph Classes
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
Johannes Köbler
CRYPTO
2006
Springer
108views Cryptology» more  CRYPTO 2006»
15 years 6 months ago
Inverting HFE Is Quasipolynomial
In the last ten years, multivariate cryptography has emerged as a possible alternative to public key cryptosystems based on hard computational problems from number theory. Notably,...
Louis Granboulan, Antoine Joux, Jacques Stern