祸害隐伏
发表于 2025-3-28 17:08:47
https://doi.org/10.1007/978-3-319-32088-5This is an attempt to simplify and justify the notions of deterministic and randomized reductions, an attempt to derive these notions from (more or less) first principles.
Anticoagulant
发表于 2025-3-28 19:37:57
http://reply.papertrans.cn/24/2338/233769/233769_42.png
Vasodilation
发表于 2025-3-29 00:45:34
https://doi.org/10.1007/978-1-349-07780-9We present goal directed computation prcedures for classical, intuitionistic and linear implication. The procedure allows for using assumptions at most once. Completeness is proved and proof theoretic results such as interpolation are indicated
非实体
发表于 2025-3-29 03:53:47
http://reply.papertrans.cn/24/2338/233769/233769_44.png
accrete
发表于 2025-3-29 09:52:11
The Content of Computer Science,We shall show that the finite Ramsey theorem as a Δ. schema is provable in ..+Ω.. As a consequence we get that propositional formulas expressing the finite Ramsey theorem have polynomial-size bounded-depth Frege proofs.
埋伏
发表于 2025-3-29 12:48:31
On the reduction theory for average case complexity,This is an attempt to simplify and justify the notions of deterministic and randomized reductions, an attempt to derive these notions from (more or less) first principles.
judicial
发表于 2025-3-29 17:02:23
http://reply.papertrans.cn/24/2338/233769/233769_47.png
陪审团每个人
发表于 2025-3-29 23:07:57
http://reply.papertrans.cn/24/2338/233769/233769_48.png
Nebulous
发表于 2025-3-30 03:47:19
Randomness and turing reducibility restraints,A definition of random sequences equivalent to the one of Martin-Löf and Schnorr motivated by the hierarchy of Turing reducibility restraints is introduced and compared with different similarily obtained notions.
RADE
发表于 2025-3-30 07:20:50
,Ramsey’s theorem in bounded arithmetic,We shall show that the finite Ramsey theorem as a Δ. schema is provable in ..+Ω.. As a consequence we get that propositional formulas expressing the finite Ramsey theorem have polynomial-size bounded-depth Frege proofs.