论文信息 - Count(q) versus the Pigeon-Hole Principle - 字舞流文

Count(q) versus the Pigeon-Hole Principle

For each p A corollary is a complete classification of the Count(q) versus Count(p) problem. Another corollary solves an open question by M. Ajtai.

[1] Lars Arge,et al. External-Storage Data Structures for Plane-Sweep Algorithms , 1994 .

[2] Allan Cheng,et al. Local Model Checking and Traces , 1994 .

[3] Arne Skou,et al. Automatic Verification of Real-Timed Systems Using , 1994 .

[4] Søren Riis. Bootstrapping the Primitive Recursive Functions by 47 Colors , 1994 .

[5] Søren Riis. Finitisation in Bounded Arithmetic , 1994 .

[6] Sten Agerholm. LCF Examples in HOL , 1994 .

[7] Søren Riis. Count(q) does not imply Count(p) , 1994 .

[8] Russell Impagliazzo,et al. Exponential lower bounds for the pigeonhole principle , 1992, STOC '92.

[9] Peter D. Mosses,et al. An Action Semantics for ML Concurrency Primitives , 1994, FME.

[10] Miklós Ajtai,et al. The independence of the modulo p counting principles , 1994, STOC '94.

[11] Toniann Pitassi,et al. An exponential separation between the matching principle and the pigeonhole principle , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[12] Jan Krajícek,et al. An Exponenetioal Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle , 1995, Random Struct. Algorithms.

[13] Søren Riis. A Fractal which violates the Axiom of Determinacy , 1994 .