Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Sensing as a complexity measure

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

DOI10.1007/978-3-319-60252-3_1zbMATH Open1426.68135OpenAlexW2620741135MaRDI QIDQ2400985FDOQ2400985


Authors: Shaull Almagor, Denis Kuperberg, Orna Kupferman Edit this on Wikidata


Publication date: 31 August 2017


Full work available at URL: https://hal.inria.fr/hal-01657019/file/440206_1_En_1_Chapter.pdf




Recommendations

  • Sensing as a complexity measure
  • Relativization of complexity and sensitivity
  • Tighter relations between sensitivity and other complexity measures
  • MEASURING COMPLEXITY: A RELATIVE ASPECT OF PATTERN RECOGNITION
  • The Sensing Capacity of Sensor Networks
  • Sensing enhancement on complex networks
  • The sensing cost of monitoring and synthesis


Mathematics Subject Classification ID

Formal languages and automata (68Q45)



Cited In (1)

  • Relativization of complexity and sensitivity





This page was built for publication: Sensing as a complexity measure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2400985)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2400985&oldid=15038597"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 2 February 2024, at 19:48. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki