Conference item

The complexity of conservative valued CSPs

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

Kolmogorov, V., & Živný, S. (2012). The complexity of conservative valued CSPs. Proceedings of the 23rd Annual ACM−SIAM Symposium on Discrete Algorithms (SODA'12).

MLA Style

Kolmogorov, V., and S. Živný. “The Complexity of Conservative Valued CSPs.” Proceedings of the 23rd Annual ACM−SIAM Symposium on Discrete Algorithms (SODA'12), SIAM, 2012.

Chicago Style

Kolmogorov, V, and S Živný. 2012. “The Complexity of Conservative Valued CSPs.” In Proceedings of the 23rd Annual ACM−SIAM Symposium on Discrete Algorithms (SODA'12). SIAM.
Share
Print

Authors

+ Kolmogorov, V More by this author

Role:: Author

+ Živný, S More by this author

Role:: Author

Publisher:: SIAM
Host title:: Proceedings of the 23rd Annual ACM−SIAM Symposium on Discrete Algorithms (SODA'12)
Publication date:: 2012-01-01

UUID:: uuid:df350199-a000-4f89-a6e2-e96c350aeeb8
Local pid:: cs:7102
Deposit date:: 2015-03-31

Terms of use

Copyright date:: 2012

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

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