Referenced Items are not available for this document.
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomized algorithms with one-sided error.
Published in:
Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on
Date of Conference: 8-11 Oct. 2001
- Page(s):
- 210 - 219
- Print ISBN:
- 0-7695-1116-3
- INSPEC Accession Number:
- 7121394
- Digital Object Identifier :
- 10.1109/SFCS.2001.959895
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
