Videolibrary
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
Video Library
Archive
Most viewed videos

Search
RSS
New in collection






International workshop "Syntax and semantics of logical systems"
August 13, 2019 11:10–10:50, amp site on the shore of Lake Hovsgol
 


Representation of polynomially stable functions by sums of Boolean read-once functions over the elementary basis

O. V. Zubkov

Irkutsk State University
Materials:
Adobe PDF 1.3 Mb

Number of views:
This page:11

Abstract: The paper considers polynomially stable Boolean functions. Proved that Boolean read-once functions over the elementary basis of a certain kind are polynomially stable. The following is an algorithm for obtaining for any polynomial stable function its representation as a sum of such Boolean read-once functions.

Materials: .pdf (1.3 Mb)

SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru
 
Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021