3341 search results - page 48 / 669 » On Bounded Queries and Approximation |
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...
DATE
2003
IEEE
15 years 3 months ago
2003
IEEE
: Binary Decision Diagrams (BDDs) have been widely used in synthesis and verification. Boolean Satisfiability (SAT) Solvers, on the other hand, have been gaining
WG
2001
Springer
15 years 2 months ago
2001
Springer
INFOCOM
1996
IEEE
15 years 1 months ago
1996
IEEE
APPROX
2006
Springer
15 years 1 months ago
2006
Springer