[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BeameKPS98>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Michael_E._Saks>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Paul_Beame>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Richard_M._Karp>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Toniann_Pitassi>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1145%2F276698.276870>
foaf:homepage <https://doi.org/10.1145/276698.276870>
dc:identifier DBLP conf/stoc/BeameKPS98 (xsd:string)
dc:identifier DOI doi.org%2F10.1145%2F276698.276870 (xsd:string)
dcterms:issued 1998 (xsd:gYear)
rdfs:label On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Michael_E._Saks>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Paul_Beame>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Richard_M._Karp>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Toniann_Pitassi>
swrc:pages 561-571 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/stoc/1998>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/stoc/BeameKPS98/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/stoc/BeameKPS98>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/stoc/stoc1998.html#BeameKPS98>
rdfs:seeAlso <https://doi.org/10.1145/276698.276870>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/stoc>
dc:title On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document