<https://kar.kent.ac.uk/id/document/1247441>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://eprints.org/ontology/Document> .
<https://kar.kent.ac.uk/id/document/1247441>	<http://www.w3.org/2007/05/powder-s#describedby>	<https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/export_kar_RDFN3.n3> .
<https://kar.kent.ac.uk/id/document/1247441>	<http://www.w3.org/2000/01/rdf-schema#label>	"Formal Proof of Polynomial-Time Complexity with Quasi-Interpretations (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://kar.kent.ac.uk/id/document/1247441>	<http://eprints.org/relation/isVolatileVersionOf>	<https://kar.kent.ac.uk/id/document/839671> .
<https://kar.kent.ac.uk/id/document/1247441>	<http://www.w3.org/2007/05/powder-s#describedby>	<https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/export_kar_RDFN3.n3> .
<https://kar.kent.ac.uk/id/document/1247441>	<http://eprints.org/relation/ispreviewThumbnailVersionOf>	<https://kar.kent.ac.uk/id/document/839671> .
<https://kar.kent.ac.uk/id/document/1247441>	<http://eprints.org/relation/isVersionOf>	<https://kar.kent.ac.uk/id/document/839671> .