Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Pseudo-average block sensitivity equals average sensitivity

From MaRDI portal
Publication:293418
Jump to:navigation, search

DOI10.1016/S0020-0190(98)00140-9zbMath1339.94102MaRDI QIDQ293418

F. Blanchet-Sadri, M. Dambrine

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001409?np=y


zbMATH Keywords

sensitivitycombinatorial problemsBoolean functionblock sensitivity


Mathematics Subject Classification ID


Related Items (1)

Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables




Cites Work

  • The average sensitivity of bounded-depth circuits
  • Sensitivity vs. block sensitivity (an average-case study)
  • Sensitivity vs. block sensitivity of Boolean functions
  • Constant depth circuits, Fourier transform, and learnability
  • Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
  • CREW PRAM<scp>s</scp> and Decision Trees




This page was built for publication: Pseudo-average block sensitivity equals average sensitivity

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:293418&oldid=12174838"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 02:09.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki