k-SAT Is No Harder Than Decision-Unique-k-SAT. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/csr/CalabroP09>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Chris_Calabro>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Ramamohan_Paturi>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1007%2F978-3-642-03351-3%5F8>
foaf:homepage	<https://doi.org/10.1007/978-3-642-03351-3_8>
dc:identifier	DBLP conf/csr/CalabroP09 (xsd:string)
dc:identifier	DOI doi.org%2F10.1007%2F978-3-642-03351-3%5F8 (xsd:string)
dcterms:issued	2009 (xsd:gYear)
rdfs:label	k-SAT Is No Harder Than Decision-Unique-k-SAT. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Chris_Calabro>
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Ramamohan_Paturi>
swrc:pages	59-70 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/csr/2009>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/csr/CalabroP09/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/csr/CalabroP09>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/csr/csr2009.html#CalabroP09>
rdfs:seeAlso	<https://doi.org/10.1007/978-3-642-03351-3_8>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/csr>
dc:subject	k-SAT; unique satisfiability; exponential complexity; quantified Boolean formulas; hitting set; independent set (xsd:string)
dc:title	k-SAT Is No Harder Than Decision-Unique-k-SAT. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document