This HTML5 document contains 41 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n17http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n9http://linked.opendata.cz/resource/domain/vavai/projekt/
n7http://linked.opendata.cz/ontology/domain/vavai/
n15http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n16http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985840%3A_____%2F09%3A00337059%21RIV10-MSM-67985840/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n14http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n18http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F09%3A00337059%21RIV10-MSM-67985840
rdf:type
n7:Vysledek skos:Concept
dcterms:description
We show that the bounded arithmetic theory V-0 does not prove that the polynomial time hierarchy collapses to the linear time hierarchy (without parameters). The result follows from a lower bound for bounded depth circuits computing prefix parity, where the circuits are allowed some auxiliary input; we derive this from a theorem of Ajtai. We show that the bounded arithmetic theory V-0 does not prove that the polynomial time hierarchy collapses to the linear time hierarchy (without parameters). The result follows from a lower bound for bounded depth circuits computing prefix parity, where the circuits are allowed some auxiliary input; we derive this from a theorem of Ajtai.
dcterms:title
The polynomial and linear time hierarchies in V-0 The polynomial and linear time hierarchies in V-0
skos:prefLabel
The polynomial and linear time hierarchies in V-0 The polynomial and linear time hierarchies in V-0
skos:notation
RIV/67985840:_____/09:00337059!RIV10-MSM-67985840
n3:aktivita
n8:Z n8:P
n3:aktivity
P(LC505), Z(AV0Z10190503)
n3:cisloPeriodika
5
n3:dodaniDat
n18:2010
n3:domaciTvurceVysledku
n17:6610714
n3:druhVysledku
n12:J
n3:duvernostUdaju
n10:S
n3:entitaPredkladatele
n16:predkladatel
n3:idSjednocenehoVysledku
334192
n3:idVysledku
RIV/67985840:_____/09:00337059
n3:jazykVysledku
n14:eng
n3:klicovaSlova
Prefix parity; linear hierarchy; bounded arithmetic; bounded depth circuits
n3:klicoveSlovo
n4:bounded%20depth%20circuits n4:bounded%20arithmetic n4:Prefix%20parity n4:linear%20hierarchy
n3:kodStatuVydavatele
DE - Spolková republika Německo
n3:kontrolniKodProRIV
[9404566CEEC4]
n3:nazevZdroje
Mathematical Logic Quarterly
n3:obor
n13:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:projekt
n9:LC505
n3:rokUplatneniVysledku
n18:2009
n3:svazekPeriodika
55
n3:tvurceVysledku
Kolodziejczyk, L.. A. Thapen, Neil
n3:wos
000270961200004
n3:zamer
n15:AV0Z10190503
s:issn
0942-5616
s:numberOfPages
6