Freedman, Michael H. \(k\)-sat on groups and undecidability. (English) Zbl 1028.68068 STOC ’98. Proceedings of the 30th annual ACM symposium on theory of computing, Dallas, TX, USA, May 23-26, 1998. New York, NY: ACM, Association for Computing Machinery. 572-576 (1998). Cited in 2 Documents MSC: 68Q25 Analysis of algorithms and problem complexity Keywords:general Boolean formula PDFBibTeX XMLCite \textit{M. H. Freedman}, in: Proceedings of the 30th annual ACM symposium on theory of computing, STOC '98. Dallas, TX, USA, May 23--26, 1998. New York, NY: ACM, Association for Computing Machinery. 572--576 (1998; Zbl 1028.68068)