Elektronický seminář o výpočetní složitosti

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F05%3A00089738" target="_blank" >RIV/67985840:_____/05:00089738 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Electronic Colloquium on Computational Complexity (ECCCC)

Popis výsledku v původním jazyce

In this paper we propose the study of a new model of restricted branching programs which we call incremental branching programs. This is in line with the program proposed by Cook in 1974 as an approach for separating the class of problems solvable in logarithmic space from problems solvabel in polynomial time, focusing on the P-complete problem GEN. We show that our model captures and possibly supersedes previously studied structured models of computation for GEN, namely marking machines Cook (1994) andPoon´s (1993) extension of jumping automata on graphs that were originally defined by Cook and Rackoff (1980). We show several exponential lower bounds for variants of our model although we are unable to prove any strong lower bounds for the most general variant of incremental branching programs. Some of our techniques also yield exponential lower bounds without the incrementality restriction, under some other conditions.

Název v anglickém jazyce

Electronic Colloquium on Computational Complexity (ECCCC)

Popis výsledku anglicky

In this paper we propose the study of a new model of restricted branching programs which we call incremental branching programs. This is in line with the program proposed by Cook in 1974 as an approach for separating the class of problems solvable in logarithmic space from problems solvabel in polynomial time, focusing on the P-complete problem GEN. We show that our model captures and possibly supersedes previously studied structured models of computation for GEN, namely marking machines Cook (1994) andPoon´s (1993) extension of jumping automata on graphs that were originally defined by Cook and Rackoff (1980). We show several exponential lower bounds for variants of our model although we are unable to prove any strong lower bounds for the most general variant of incremental branching programs. Some of our techniques also yield exponential lower bounds without the incrementality restriction, under some other conditions.

Druh

O - Ostatní výsledky

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2005

Kód důvěrnosti údajů

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