Back to Search

Book

Sparsity of Non−trivial Proving Speed−up in Random Systems of Propositional Calculus

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

Hernandez−Orozco, S., Hernandez−Quiroz, F., & Zenil, H. (2013). Sparsity of Non−trivial Proving Speed−up in Random Systems of Propositional Calculus (P. Bonizzoni, V. Brattka, & B. Lowe, Eds.).

MLA Style

Hernandez−Orozco, S., et al. Sparsity of Non−Trivial Proving Speed−up in Random Systems of Propositional Calculus. Edited by P Bonizzoni et al., 2013.

Chicago Style

Hernandez−Orozco, S, F Hernandez−Quiroz, and H Zenil. 2013. Sparsity of Non−Trivial Proving Speed−up in Random Systems of Propositional Calculus. Edited by P Bonizzoni, V Brattka, and B Lowe.
Tweet
Print

Authors

+ Hernandez−Orozco, S More by this author

Role:

Author

+ Hernandez−Quiroz, F More by this author

Role:

Author

+ Zenil, H More by this author

Role:

Author

Contributors

Role:

Editor

Role:

Editor

Role:

Editor

Bibliographic Details

Host title:: The Nature of Computation‚ Logic‚ Algorithms‚ Applications; 9th Conference on Computability in Europe‚ CiE 2013
Publication date:: 2013-01-01

Item Description

UUID:: uuid:8a81db74-870d-4d31-ace5-282190a73c89
Local pid:: cs:9314
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