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

Computational versus causal complexity

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

DOI10.1023/A:1011855915651zbMATH Open1012.68103OpenAlexW1488304136MaRDI QIDQ2781923

Matthias Scheutz

Publication date: 11 April 2002

Published in: Minds and Machines (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011855915651



zbMATH Keywords

computational complexitybisimulation


Mathematics Subject Classification ID

Formal languages and automata (68Q45) General topics in artificial intelligence (68T01)



Related Items (2)

Is computational complexity a barrier to manipulation? ⋮ Causal computational complexity of distributed processes






This page was built for publication: Computational versus causal complexity

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2781923&oldid=15670092"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 17:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki