Cargando…

Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT

Detalles Bibliográficos
Autores principales: Berman, Paul R, Karpinski, M, Scott, A D
Lenguaje:eng
Publicado: 2003
Materias:
XX
Acceso en línea:http://cds.cern.ch/record/630836
_version_ 1780900631597285376
author Berman, Paul R
Karpinski, M
Scott, A D
author_facet Berman, Paul R
Karpinski, M
Scott, A D
author_sort Berman, Paul R
collection CERN
id cern-630836
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 2003
record_format invenio
spelling cern-6308362019-09-30T06:29:59Zhttp://cds.cern.ch/record/630836engBerman, Paul RKarpinski, MScott, A DApproximation Hardness and Satisfiability of Bounded Occurrence Instances of SATXXIHES-M-2003-25MPI-2003-44oai:cds.cern.ch:6308362003
spellingShingle XX
Berman, Paul R
Karpinski, M
Scott, A D
Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT
title Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT
title_full Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT
title_fullStr Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT
title_full_unstemmed Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT
title_short Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT
title_sort approximation hardness and satisfiability of bounded occurrence instances of sat
topic XX
url http://cds.cern.ch/record/630836
work_keys_str_mv AT bermanpaulr approximationhardnessandsatisfiabilityofboundedoccurrenceinstancesofsat
AT karpinskim approximationhardnessandsatisfiabilityofboundedoccurrenceinstancesofsat
AT scottad approximationhardnessandsatisfiabilityofboundedoccurrenceinstancesofsat