[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kogan96>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Grigory_Kogan>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1996.548469>
foaf:homepage <https://doi.org/10.1109/SFCS.1996.548469>
dc:identifier DBLP conf/focs/Kogan96 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FSFCS.1996.548469 (xsd:string)
dcterms:issued 1996 (xsd:gYear)
rdfs:label Computing Permanents over Fields of Characteristic 3: Where and Why It Becomes Difficult (extended abstract). (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Grigory_Kogan>
swrc:pages 108-114 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/focs/1996>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/focs/Kogan96/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/focs/Kogan96>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/focs/focs96.html#Kogan96>
rdfs:seeAlso <https://doi.org/10.1109/SFCS.1996.548469>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/focs>
dc:subject computational complexity; complexity; permanents; fields of characteristic 3; polynomial time algorithm; polynomial-time algorithm; matrix (xsd:string)
dc:title Computing Permanents over Fields of Characteristic 3: Where and Why It Becomes Difficult (extended abstract). (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document