A polynomial time solution to constraint satisfaction problems by neural−like P systems - ORA - Oxford University Research Archive

Back to Search

Journal article

A polynomial time solution to constraint satisfaction problems by neural−like P systems

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Xu, L., Zeng, X., & Jeavons, P. (2016). A polynomial time solution to constraint satisfaction problems by neural−like P systems. International Journal of Unconventional Computing, 9(5−6), 465–481.

MLA Style

Xu, L., et al. “A Polynomial Time Solution to Constraint Satisfaction Problems by Neural−like P Systems.” International Journal of Unconventional Computing, vol. 9, no. 5−6, 2016, pp. 465–81.

Chicago Style

Xu, L, X Zeng, and P Jeavons. 2016. “A Polynomial Time Solution to Constraint Satisfaction Problems by Neural−like P Systems.” International Journal of Unconventional Computing 9 (5−6): 465–81.
Tweet
Print

Authors

+ Xu, L More by this author

Role:

Author

+ Zeng, X More by this author

Role:

Author

+ Jeavons, P More by this author

Role:

Author

Bibliographic Details

Journal:: International Journal of Unconventional Computing
Volume:: 9
Issue:: 5−6
Pages:: 465-481
Publication date:: 2013-01-01

Item Description

UUID:: uuid:6225fde6-6cfc-4236-8424-692edb3f0a3f
Local pid:: cs:7482
Deposit date:: 2015-03-31

Terms of use

Copyright date:: 2013

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Metrics

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP