Structured pigeonhole principle, search problems and hard tautologies
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F05%3A00022098" target="_blank" >RIV/67985840:_____/05:00022098 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Structured pigeonhole principle, search problems and hard tautologies
Original language description
We consider exponentially large finite relational structures whose basic relations are computed by polynomial size circuits. We study behaviour of such structures when pulled back by (nonuniform) polynomial-time maps to a bigger or to a smaller universe.This is applied to proof complexity and to complexity of search problems.
Czech name
Strukturovaný PHP, vyhledávací problémy a obtížné tautologie
Czech description
Uvažujeme exponenciálně velké relační struktury jejichž základní relace jsou definovány polynomiálně velkými obvody. Toto je aplikováno v důkazové složitosti a složitosti vyhladávacích problémů
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2005
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Symbolic Logic
ISSN
0022-4812
e-ISSN
—
Volume of the periodical
70
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
12
Pages from-to
619-630
UT code for WoS article
—
EID of the result in the Scopus database
—