Emre Yolcu is a computer scientist whose research includes proof complexity, Boolean satisfiability and automated deduction. These subjects distinguish the existence of a short formal proof from the computational task of finding it.[ref]
With Xinyu Wu and Marijn Heule, he studied Mycielski graphs through clausal proofs of their colouring requirements. Their work constructed short proofs in a propagation-redundancy system and compared their availability with the behaviour of automated proof search.[ref]
Mycielski graphs and PR proofs by Emre Yolcu and others. Abstract and introduction
Homepage: emreyolcu.com/
New to topics? Read the docs here!