2430 search results - page 392 / 486 » Computing Tutte Polynomials |
113
click to vote
SAT
2007
Springer
15 years 9 months ago
2007
Springer
In this paper a new circuit sat based encoding of boolean formula is proposed. It makes an original use of the concept of restrictive models introduced by Boufkhad to polynomially ...
104
Voted
TAMC
2007
Springer
15 years 9 months ago
2007
Springer
For generalized Reed-Solomon codes, it has been proved [7] that the problem of determining if a received word is a deep hole is coNP-complete. The reduction relies on the fact that...
103
click to vote
DATE
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract: This paper addresses the problem of equivalence veriļ¬cation of RTL descriptions that implement arithmetic computations (add, mult, shift) over bitvectors that have diļ¬...
119
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
ā We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically fail to detect attacks and also gener...
130
click to vote
QEST
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract. We present a compositional theory of system veriļ¬cation, where speciļ¬cations assign real-numbered costs to systems. These costs can express a wide variety of quantita...