Tautologies from pseudo-random generators.

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F01%3A05010036" target="_blank" >RIV/67985840:_____/01:05010036 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Tautologies from pseudo-random generators.

Original language description

We consider tautologies formed from a pseudo-random number generator. We explain a strategy of proving their hardness for Extended Frege systems via a conjecture about bounded arithmetic. Further we give a purely finitary statement, in the form of a hardness condition imposed on a function, equivalent to the conjecture.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/IAA1019901" target="_blank" >IAA1019901: Mathematical logic and computational complexity</a><br>

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2001

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Bulletin of Symbolic Logic

ISSN

1079-8986

e-ISSN

—

Volume of the periodical

7

Issue of the periodical within the volume

2

Country of publishing house

US - UNITED STATES

Number of pages

16

Pages from-to

197-212

UT code for WoS article

—

EID of the result in the Scopus database

—