Jelena Tomasevic

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We present a new type of sat problem called the k-gd-sat, which generalizes k-sat and gd-sat. In k-gd-sat, clause lengths have geometric distribution, controlled by a probability parameter p; for p = 1, a k-gd-sat problem is a k-sat problem. We report on the phase transition between satisfiability and unsatisfiability for randomly generated instances of(More)
  • 1