Tautologies from Pseudo-Random Generators
Keyword(s):
AbstractWe consider tautologies formed from a pseudo-random number generator, defined in Krajíček [11] and in Alekhnovich et al. [2]. We explain a strategy of proving their hardness for Extended Frege systems via a conjecture about bounded arithmetic formulated in Krajíček [11]. Further we give a purely finitary statement, in the form of a hardness condition imposed on a function, equivalent to the conjecture.
2013 ◽
Vol 16
(2)
◽
pp. 210-216
◽
2019 ◽
Vol 98
◽
pp. 174-180
◽
2014 ◽
Vol 4
(6)
◽
pp. 28-33
◽
2020 ◽
Vol 8
(6)
◽
pp. 5741-5748
1979 ◽
Vol C-28
(9)
◽
pp. 637-642
◽
2017 ◽
Vol 28
(06)
◽
pp. 1750078
◽