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

Sensitive functions and approximate problems

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

DOI10.1006/INCO.1996.0043zbMath0853.68096OpenAlexW2025498872MaRDI QIDQ1917103

Shiva P. Chaudhuri

Publication date: 3 July 1996

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11858/00-001M-0000-0014-B75D-D


zbMATH Keywords

approximate countingapproximate selectionapproximate compactionCREW PRAM complexitypadded sorting


Mathematics Subject Classification ID

Searching and sorting (68P10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)


Related Items (2)

Sensitivity, block sensitivity, and \(\ell\)-block sensitivity of Boolean functions ⋮ The complexity of parallel prefix problems on small domains







This page was built for publication: Sensitive functions and approximate problems

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