About: Interval Extensions of Partially Defined Boolean Functions     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
  • Intervalové funkce tvoří speciální podtřídu booleovských funkcí, pro které je snadné a rychlé zjistit jejich funkční hodnotu na vstupním vektoru. Jejich hodnota je true, pokud vstupní vektor reprezentuje číslo z intervalu [a,b]. Částečně definovaná booleovská funkce je dvojice (T,F) množin vektorů reprezentujících truepointy, resp. falsepointy. V článku se zabýváme problémem hledání intervalového rozšíření dané pdBf, tedy intervalové funkce, která se s shoduje s pdBf v jejích truepointech i falsepointech. Sestrojíme polynomiální algoritmus řešící tento problém. (cs)
  • Interval functions constitute quite a special class of Boolean functions for which it is very easy and fast to determine their functional value on a specified input vector. The value of an n-variable interval function specified by interval [a, b] (where a and b are n-bit binary numbers) is true if and only if the input vector viewed as an n-bit number belongs to the interval [a, b]. Partially defined Boolean function (pdBf) is a pair (T, F) of sets of vectors representing truepoints and falsepoints respectively. In this paper we study the problem of finding an interval extension of given pdBf, that is a Boolean function f which respects truepoints and falsepoints of the input pdBf and can be represented by an interval. We present a polynomial-time algorithm which solves this problem.
  • Interval functions constitute quite a special class of Boolean functions for which it is very easy and fast to determine their functional value on a specified input vector. The value of an n-variable interval function specified by interval [a, b] (where a and b are n-bit binary numbers) is true if and only if the input vector viewed as an n-bit number belongs to the interval [a, b]. Partially defined Boolean function (pdBf) is a pair (T, F) of sets of vectors representing truepoints and falsepoints respectively. In this paper we study the problem of finding an interval extension of given pdBf, that is a Boolean function f which respects truepoints and falsepoints of the input pdBf and can be represented by an interval. We present a polynomial-time algorithm which solves this problem. (en)
Title
  • Interval Extensions of Partially Defined Boolean Functions
  • Interval Extensions of Partially Defined Boolean Functions (en)
  • Intervalová rozšíření částečně definovaných booleovských funkcí (cs)
skos:prefLabel
  • Interval Extensions of Partially Defined Boolean Functions
  • Interval Extensions of Partially Defined Boolean Functions (en)
  • Intervalová rozšíření částečně definovaných booleovských funkcí (cs)
skos:notation
  • RIV/00216208:11320/06:00003130!RIV07-MSM-11320___
http://linked.open.../vavai/riv/strany
  • 457;462
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GD201/05/H014), Z(MSM0021620838)
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
  • 480217
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/06:00003130
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Interval; Extensions; Partially; Defined; Boolean; Functions (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [9741FD9B90C5]
http://linked.open...v/mistoKonaniAkce
  • Athens
http://linked.open...i/riv/mistoVydani
  • Athens
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the 6th WSEAS International Conference on APPLIED COMPUTER SCIENCE (ACS '06)
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...iv/tvurceVysledku
  • Kučera, Petr
  • Kronus, David
  • Čepek, Ondřej
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • WSEAS
https://schema.org/isbn
  • 960-8457-57-2
http://localhost/t...ganizacniJednotka
  • 11320
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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software