Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnaya Matematika, 2017, Volume 29, Issue 2, Pages 133–159
DOI: https://doi.org/10.4213/dm1434 (Mi dm1434) 		 
This article is cited in 2 scientific papers (total in 2 papers)

On the average-case complexity of underdetermined functions

A. V. Chashkin

Lomonosov Moscow State University
Full-text PDF (624 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1434
Abstract: The average-case complexity of computation of underdetermined functions by straight-line programs with conditional stop over the basis of all at most two-place Boolean functions is considered. Correct order estimates of the average-case complexity of functions with maximum average-case complexity among all underdetermined functions are derived depending on the degree of their determinacy, the size of their domain, and the size of their support.
Keywords: underdetermined function, Boolean function, Boolean circuit, straight-line program, average-case complexity.
Funding agency Grant number
Russian Foundation for Basic Research 14-01-00598
This work was supported by the Russian Foundation for Basic Research, project no. 14-01-00598.
Received: 16.01.2017
English version:
Discrete Mathematics and Applications, 2018, Volume 28, Issue 3, Pages 201–221
DOI: https://doi.org/10.1515/dma-2018-0019
Bibliographic databases:
Document Type: Article
UDC: 519.714.4
Language: Russian
Citation: A. V. Chashkin, “On the average-case complexity of underdetermined functions”, Diskr. Mat., 29:2 (2017), 133–159; Discrete Math. Appl., 28:3 (2018), 201–221
Citation in format AMSBIB
\Bibitem{Cha17}
\by A.~V.~Chashkin
\paper On the average-case complexity of underdetermined functions
\jour Diskr. Mat.
\yr 2017
\vol 29
\issue 2
\pages 133--159
\mathnet{http://mi.mathnet.ru/dm1434}
\crossref{https://doi.org/10.4213/dm1434}
\elib{https://elibrary.ru/item.asp?id=29437300}
\transl
\jour Discrete Math. Appl.
\yr 2018
\vol 28
\issue 3
\pages 201--221
\crossref{https://doi.org/10.1515/dma-2018-0019}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000442245400001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85053163039}
Linking options:
  • https://www.mathnet.ru/eng/dm1434
  • https://doi.org/10.4213/dm1434
  • https://www.mathnet.ru/eng/dm/v29/i2/p133
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:337
    Full-text PDF :52
    References:48
    First page:28
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024