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

On the complexity of inexact computations

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

DOI10.1016/0020-0190(75)90007-1zbMath0326.68029OpenAlexW2168494561MaRDI QIDQ1225931

Judea Pearl

Publication date: 1975

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

Full work available at URL: https://doi.org/10.1016/0020-0190(75)90007-1



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)


Related Items

SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY ⋮ Information theory and the complexity of boolean functions



Cites Work

  • Complexity of decoders--I: Classes of decoding rules
  • Computational Work and Time on Finite Machines
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1225931&oldid=13300215"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 08:16.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki