[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/mfcs/HavasS99>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/George_Havas>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Jean-Pierre_Seifert>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F3-540-48340-3%5F10>
foaf:homepage <https://doi.org/10.1007/3-540-48340-3_10>
dc:identifier DBLP conf/mfcs/HavasS99 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F3-540-48340-3%5F10 (xsd:string)
dcterms:issued 1999 (xsd:gYear)
rdfs:label The Complexity of the Extended GCD Problem. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/George_Havas>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Jean-Pierre_Seifert>
swrc:pages 103-113 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/mfcs/1999>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/mfcs/HavasS99/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/mfcs/HavasS99>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/mfcs/mfcs99.html#HavasS99>
rdfs:seeAlso <https://doi.org/10.1007/3-540-48340-3_10>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/mfcs>
dc:subject Approximation algorithms; computational problems of diophantine equations; extended gcd computations; NP-hardness; probabilistically checkable proofs; interactive proof systems (xsd:string)
dc:title The Complexity of the Extended GCD Problem. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document