Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Computational complexity of s...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
Computational complexity of some restricted instances of 3-SAT
Bibliographic Details
Main Authors:
Berman, P
,
Karpinski, M
,
Scott, A
Format:
Journal article
Published:
2007
Holdings
Description
Similar Items
Staff View
Description
Summary:
Similar Items
Scale-Free Random SAT Instances
by: Carlos Ansótegui , et al.
Published: (2022-06-01)
Simulations of error in quantum adiabatic computations of random 2-SAT instances
by: Gill, Jay S. (Jay Singh)
Published: (2007)
The Impact of Implied Constraints on MaxSAT B2B Instances
by: Miquel Bofill, et al.
Published: (2022-08-01)
An evaluation of the performance of the quantum adiabatic algorithm on random instances of k-SAT
by: McBride, James, 1973-
Published: (2006)
Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms
by: Puya Mirkarimi, et al.
Published: (2023-06-01)