We prove, under a computational complexity hypothesis, that it is consistent with the true universal theory of p-time algorithms that a specific p-time function extending bits to bits violates the dual weak pigeonhole principle: Every string equals the value of the function for some . The function is the truth-table function assigning to a circuit the table of the function it computes and the hypothesis is that every language in P has circuits of a fixed polynomial size .

中文翻译：

---

p-time 算法通用理论中的小电路和对偶弱 PHP

我们证明，在计算复杂性假设下，特定的 p-time 函数扩展与 p-time 算法的真正普遍理论是一致的 位到 bits 违反了对偶弱鸽子原则：每个字符串 等于某些函数的值 . 该函数是真值表函数，将其计算的函数表分配给电路，假设 P 中的每种语言都有固定多项式大小的电路 .