论文信息 - On ultrafilters and NP

On ultrafilters and NP

The fusion method (A. Wigderson, 1993) is developed by exploring its similarities with the ultraproduct construction in model theory. We use this analogy to re-prove a result of M. Sipser (1984) regarding countable circuits, in a simpler way. In the finite case this analogy allows us to give a new characterization of co-NP in terms of the CLIQUE function. This gives a natural interpretation to the NP-completeness of the CLIQUE function.<<ETX>>

Eyal Kushilevitz | Shai Ben-David | Mauricio Karchmer

[1] Avi Wigderson,et al. Characterizing non-deterministic circuit size , 1993, STOC '93.

[2] Mauricio Karchmer,et al. On proving lower bounds for circuit size , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[3] Uri Zwick. A 4n Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions , 1991, SIAM J. Comput..

[4] Avi Wigderson,et al. On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[5] Alexander A. Razborov,et al. On the method of approximations , 1989, STOC '89.

[6] Michael Sipser,et al. The history and status of the P versus NP question , 1992, STOC '92.

[7] A. A. Razborov. Lower bounds of the complexity of symmetric boolean functions of contact-rectifier circuits , 1990 .

[8] Chen C. Chang,et al. Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[9] Michael Sipser,et al. A Topological View of Some Problems in Complexity Theory , 1984, MFCS.