%0 Conference Proceedings
%T Coordinating Parallel Mobile Ambients to Solve SAT Problem in Polynomial Number of Steps
%+ Department of Computer Science [Lasi]
%A Aman, Bogdan
%A Ciobanu, Gabriel
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 14th International Conference on Coordination Models and Languages (COORDINATION)
%C Stockholm, Sweden
%Y Marjan Sirjani
%I Springer
%3 Coordination Models and Languages
%V LNCS-7274
%P 122-136
%8 2012-06-14
%D 2012
%R 10.1007/978-3-642-30829-1_9
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X In this paper we present a version of mobile ambients, called parMA, having a weak form of replication and a parallel semantics. We investigate how parMA can solve intractable problems in a polynomial number of computational steps. We use parMA to give a semiuniform solution to a well-known strong NP-complete problem, namely to the Boolean satisfiability problem (SAT).
%G English
%Z TC 6
%2 https://inria.hal.science/hal-01529591/document
%2 https://inria.hal.science/hal-01529591/file/978-3-642-30829-1_9_Chapter.pdf
%L hal-01529591
%U https://inria.hal.science/hal-01529591
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-COORDINATION
%~ IFIP-LNCS-7274