A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Phase Transition in Matched Formulas and a Heuristic for Biclique Satisfiability
[article]

2018
*
arXiv
*
pre-print

A matched formula is a CNF formula whose incidence graph admits a matching which matches a distinct variable to every clause. We study phase transition in a context of matched formulas and their generalization of biclique satisfiable formulas. We have performed experiments to find a phase transition of property "being matched" with respect to the ratio m/n where m is the number of clauses and n is the number of variables of the input formula φ. We compare the results of experiments to a

arXiv:1808.01774v1
fatcat:7fita6pky5cgpgegzzdzz2jgom