| |
| 1986 | ||
|---|---|---|
| 2 | Larry Denenberg, Yuri Gurevich, Saharon Shelah: Definability by Constant-Depth Polynomial-Size Circuits Information and Control 70(2/3): 216-240 (1986) | |
| 1984 | ||
| 1 | Larry Denenberg, Harry R. Lewis: The Complexity of the Satisfiability Problem for Krom Formulas. Theor. Comput. Sci. 30: 319-341 (1984) | |
| 1 | Yuri Gurevich | [2] |
| 2 | Harry R. Lewis | [1] |
| 3 | Saharon Shelah | [2] |