Coordinating Parallel Mobile Ambients to Solve SAT Problem in Polynomial Number of Steps - Coordination Models and Languages
Conference Papers Year : 2012

Coordinating Parallel Mobile Ambients to Solve SAT Problem in Polynomial Number of Steps

Abstract

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).

Domains

Computer Science [cs] Networking and Internet Architecture [cs.NI]
Fichier principal
Vignette du fichier
978-3-642-30829-1_9_Chapter.pdf (309.56 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Hal Ifip  : Connect in order to contact the contributor

https://inria.hal.science/hal-01529591

Submitted on : Wednesday, May 31, 2017-9:59:54 AM

Last modification on : Thursday, March 28, 2024-3:18:19 PM

Long-term archiving on : Wednesday, September 6, 2017-2:33:15 PM

Download

Dates and versions

hal-01529591 , version 1 (31-05-2017)

Licence

Attribution

Identifiers

Cite

Bogdan Aman, Gabriel Ciobanu. Coordinating Parallel Mobile Ambients to Solve SAT Problem in Polynomial Number of Steps. 14th International Conference on Coordination Models and Languages (COORDINATION), Jun 2012, Stockholm, Sweden. pp.122-136, ⟨10.1007/978-3-642-30829-1_9⟩. ⟨hal-01529591⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

IFIP-LNCS IFIP IFIP-TC IFIP-TC6 IFIP-COORDINATION IFIP-LNCS-7274
52 View
70 Download

Altmetric

Share

More