APA (7th ed.) Citation

Impagliazzo, R., Paturi, R., & Schneider, S. (2013, October). A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits. Annual Symposium on Foundations of Computer Science, 479-488. https://doi.org/10.1109/FOCS.2013.58

Chicago Style (17th ed.) Citation

Impagliazzo, Russell, Ramamohan Paturi, and Stefan Schneider. "A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits." Annual Symposium on Foundations of Computer Science Oct. 2013: 479-488. https://doi.org/10.1109/FOCS.2013.58.

MLA (9th ed.) Citation

Impagliazzo, Russell, et al. "A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits." Annual Symposium on Foundations of Computer Science, Oct. 2013, pp. 479-488, https://doi.org/10.1109/FOCS.2013.58.