We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

On relativisation and complexity gap for resolution-based proof systems.

Dantchev, S. and Riis, S. (2003) 'On relativisation and complexity gap for resolution-based proof systems.', in Computer science logic : 17th International Workshop CSL 2003, 12th Annual Conference of the EACSL, 8th Kurt Gödel Colloquium, KGC 2003, 25-30 August 2003, Vienna, Austria ; proceedings. Berlin: Springer, pp. 142-154. Lecture notes in computer science. (2803).

Item Type:Book chapter
Full text:Full text not available from this repository.
Publisher Web site:
Record Created:30 Oct 2008
Last Modified:08 Nov 2010 12:17

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library