About: The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	We continue an investigation into resource-bounded Kolmogorov complexity, which highlights the close connections between circuit complexity and Levin's time-bounded Kolmogorov complexity measure Kt (and other measures with a similar flavor), and also exploits derandomization techniques to provide new insights regarding Kolmogorov complexity. The Kolmogorov measures that have been introduced have many advantages over other approaches to defining resource-bounded Kolmogorov complexity. Here, we study the properties of other measures that arise naturally in this framework.The motivation for introducing yet more notions of resource-bounded Kolmogorov complexity are two-fold: 1) to demonstrate that other complexity measures such as branching-program size and formula size can also be discussed in terms of Kolmogorov complexity, and 2) to demonstrate that notions such as nondeterministic Kolmogorov complexity and distinguishing complexity also fit well into this framework. We continue an investigation into resource-bounded Kolmogorov complexity, which highlights the close connections between circuit complexity and Levin's time-bounded Kolmogorov complexity measure Kt (and other measures with a similar flavor), and also exploits derandomization techniques to provide new insights regarding Kolmogorov complexity. The Kolmogorov measures that have been introduced have many advantages over other approaches to defining resource-bounded Kolmogorov complexity. Here, we study the properties of other measures that arise naturally in this framework.The motivation for introducing yet more notions of resource-bounded Kolmogorov complexity are two-fold: 1) to demonstrate that other complexity measures such as branching-program size and formula size can also be discussed in terms of Kolmogorov complexity, and 2) to demonstrate that notions such as nondeterministic Kolmogorov complexity and distinguishing complexity also fit well into this framework. (en)
Title	The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (en)
skos:prefLabel	The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (en)
skos:notation	RIV/67985840:_____/11:00352607!RIV11-MSM-67985840
http://linked.open...avai/predkladatel	Matematický ústav AV ČR, v. v. i.
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(1M0545), P(GAP202/10/0854), P(IAA100190902), Z(AV0Z10190503)
http://linked.open...iv/cisloPeriodika	1
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	Koucký, Michal
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Matematický ústav AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	220067
http://linked.open...ai/riv/idVysledku	RIV/67985840:_____/11:00352607
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Circuit complexity; Distinguishing complexity; FewEXP; Formula size; Kolmogorov complexity (en)
http://linked.open.../riv/klicoveSlovo	Circuit complexity Distinguishing complexity FewEXP Formula size Kolmogorov complexity
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[68B332FDDF13]
http://linked.open...i/riv/nazevZdroje	Journal of Computer and System Sciences
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...vavai/riv/projekt	Circuit Complexity and Self-Reducibility Institute for Theoretical Computer Science Mathematical logic, complexity, and algorithms
http://linked.open...UplatneniVysledku	2011
http://linked.open...v/svazekPeriodika	77
http://linked.open...iv/tvurceVysledku	Koucký, Michal Allender, E. Ronneburger, D. Roy, S.
http://linked.open...ain/vavai/riv/wos	000284450000003
http://linked.open...n/vavai/riv/zamer	Rozvoj a prohloubení obecných matematických poznatků a jejich užití v dalších vědních oborech a v praxi
issn	0022-0000
number of pages	27 (xsd:int)
is http://linked.open...avai/riv/vysledek of	The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software