[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/focs/Toran00>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Jacobo_Tor%E2%88%9A%C2%B0n>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FSFCS.2000.892080>
foaf:homepage <https://doi.org/10.1109/SFCS.2000.892080>
dc:identifier DBLP conf/focs/Toran00 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FSFCS.2000.892080 (xsd:string)
dcterms:issued 2000 (xsd:gYear)
rdfs:label On the Hardness of Graph Isomorphism. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Jacobo_Tor%E2%88%9A%C2%B0n>
swrc:pages 180-186 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/focs/2000>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/focs/Toran00/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/focs/Toran00>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/focs/focs2000.html#Toran00>
rdfs:seeAlso <https://doi.org/10.1109/SFCS.2000.892080>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/focs>
dc:subject computational complexity; encoding; graph theory; hardness; graph isomorphism; logarithmic space many-one reductions; complexity classes; probabilistic logarithmic space; determinant; hardness results; randomized logarithmic space reduction; perfect matching (xsd:string)
dc:title On the Hardness of Graph Isomorphism. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document