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
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

On the computational complexity of behavioral description-based web service composition

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

DOI10.1016/J.TCS.2011.04.020zbMath1228.68037OpenAlexW2132886830MaRDI QIDQ650907

Dongwon Lee, Wonhong Nam, Hyunyoung Kil

Publication date: 7 December 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.020


zbMATH Keywords

computational complexityincomplete informationweb service compositionbehavioral description


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Internet topics (68M11)



Uses Software

  • Unnamed Item



Cites Work

  • The temporal semantics of concurrent programs
  • Relationships between nondeterministic and deterministic tape complexities
  • Alternation
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: On the computational complexity of behavioral description-based web service composition

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