Beyersdorff, O., Blinkhorn, J., & Peitl, T. (2020). Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths. Theory and Applications of Satisfiability Testing – SAT 2020.
Styl ChicagoBeyersdorff, Olaf, Joshua Blinkhorn, a Tomáš Peitl. "Strong (D)QBF Dependency Schemes Via Tautology-Free Resolution Paths." Theory and Applications of Satisfiability Testing – SAT 2020 2020.
Citace podle MLABeyersdorff, Olaf, Joshua Blinkhorn, a Tomáš Peitl. "Strong (D)QBF Dependency Schemes Via Tautology-Free Resolution Paths." Theory and Applications of Satisfiability Testing – SAT 2020 2020.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..