论文信息 - Social choice and computational complexity - 字舞流文

Social choice and computational complexity

[1] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[2] J. H. Smith. AGGREGATION OF PREFERENCES WITH VARIABLE ELECTORATE , 1973 .

[3] Joseph R. Shoenfield,et al. Degrees of unsolvability , 1959, North-Holland mathematics studies.

[4] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[5] Kenneth O. May,et al. A Note on the Complete Independence of the Conditions for Simple Majority Decision , 1953 .

[6] Kenneth O. May,et al. A Set of Independent Necessary and Sufficient Conditions for Simple Majority Decision , 1952 .