Hardness assumptions in the foundations of theoretical computer science
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F05%3A00022096" target="_blank" >RIV/67985840:_____/05:00022096 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Hardness assumptions in the foundations of theoretical computer science
Original language description
We discuss how several seemingly unrelated conjectures in complexity theory follow from hardness assumptions of a similar nature
Czech name
Předpoklady obtížnosti v základech teoretické informatiky
Czech description
Vyložíme, jak několik na první pohled nesouvisejících hypotéz v teorii složitosti, plyne z předpokladu obtížnosti podobného tvaru.
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
Archive for Mathematical Logic
ISSN
0933-5846
e-ISSN
—
Volume of the periodical
44
Issue of the periodical within the volume
6
Country of publishing house
DE - GERMANY
Number of pages
9
Pages from-to
667-675
UT code for WoS article
—
EID of the result in the Scopus database
—