About: Structured pigeonhole principle, search problems and hard tautologies     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)

AttributesValues
rdf:type
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ů (cs)
  • 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.
  • 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. (en)
Title
  • Structured pigeonhole principle, search problems and hard tautologies
  • Structured pigeonhole principle, search problems and hard tautologies (en)
  • Strukturovaný PHP, vyhledávací problémy a obtížné tautologie (cs)
skos:prefLabel
  • Structured pigeonhole principle, search problems and hard tautologies
  • Structured pigeonhole principle, search problems and hard tautologies (en)
  • Strukturovaný PHP, vyhledávací problémy a obtížné tautologie (cs)
skos:notation
  • RIV/67985840:_____/05:00022098!RIV06-AV0-67985840
http://linked.open.../vavai/riv/strany
  • 619;630
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(IAA1019401), P(LN00A056), Z(AV0Z10190503)
http://linked.open...iv/cisloPeriodika
  • 2
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 544998
http://linked.open...ai/riv/idVysledku
  • RIV/67985840:_____/05:00022098
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • proof complexity; pigeonhole principle; serch problems (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • US - Spojené státy americké
http://linked.open...ontrolniKodProRIV
  • [DF861AC6DD63]
http://linked.open...i/riv/nazevZdroje
  • Journal of Symbolic Logic
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 70
http://linked.open...iv/tvurceVysledku
  • Krajíček, Jan
http://linked.open...n/vavai/riv/zamer
issn
  • 0022-4812
number of pages
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software