Christian Laus

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
Regular signed SAT is a variant of the well-known satisfiability problem in which the variables can take values in a fixed set V ⊂ [0, 1], and the literals have the form " x ≤ a " or " x ≥ a " instead of " x " or " ¯ x ". We answer some open question regarding random regular signed k-SAT formulas: The probability that a random formula is satisfiable(More)
  • 1