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

Ejemplares similares

Approximation Hardness of Short Symmetric Instances of MAX-3SAT
por: Berman, P, et al.
Publicado: (2004)

Uniquely Satisfiable d-Regular (k,s)-SAT Instances
por: Fu, Zufeng, et al.
Publicado: (2020)

Quantum tunneling and quantum walks as algorithmic resources to solve hard K-SAT instances
por: Campos, Ernesto, et al.
Publicado: (2021)

Rad hard and rad tolerant IC's developed to satisfy the extreme space and LHC requirements
por: Durand, G, et al.
Publicado: (1990)

Theory and applications of satisfiability testing - SAT 2019: 22nd international conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019, proceedings
por: Janota, Mikolás, et al.
Publicado: (2019)

On the problem of the bound states in the framework of the Padé approximants
por: Caneschi, L, et al.
Publicado: (1969)

On Approximability of Minimum Bisection and Related Partition Problems
por: Karpinski, M
Publicado: (2003)

Satisfiability Solving Meets Evolutionary Optimisation in Designing Approximate Circuits
por: Češka, Milan, et al.
Publicado: (2020)

Theory and applications of satisfiability testing - SAT 2018: 21st international conference, SAT 2018, held as part of the federated logic conference, FLOC 2018, Oxford, UK, July 9-12, 2018, proceedings
por: Beyersdorff, Olaf, et al.
Publicado: (2018)

Functions that satisfy mandelstam analyticity and unitarity
por: Kupsh, J
Publicado: (1969)

CERN Scientists satisfied by smashing success
Publicado: (2008)

Approximation Schemes for Metric Minimum Bisection and Partitioning
por: Fernández de la Vega, W, et al.
Publicado: (2003)

A construction of functions that satisfy crossing symmetry and unitarity
por: Kupsch, J
Publicado: (1970)

Some rigorous inequalities satisfied by double-spectral functions
por: Mahoux, G, et al.
Publicado: (1963)

Point Cloud Instance Segmentation with Inaccurate Bounding-Box Annotations
por: Peng, Yinyin, et al.
Publicado: (2023)

Depth-Bounded Approximations of Probability
por: Baldi, Paolo, et al.
Publicado: (2020)

Theory and applications of satisfiability testing - SAT 2014: 17th international conference, held as part of the Vienna summer of logic, VSL 2014, Vienna, Austria, July 14-17, 2014, proceedings
por: Sinz, Carsten, et al.
Publicado: (2014)

A model for the deep inelastic scaling functions satisfying unitarity, crossing and analyticity
por: Dahmen, H D, et al.
Publicado: (1973)

Approximation by ratios of bounded analytic functions
por: Suárez, D
Publicado: (1998)

A relativistic scattering model satisfying unitarity, crossing symmetry and analyticity
por: Khuri, N N
Publicado: (1962)

Occurrence of an $SU_{3}$ representation in the decomposition of a direct product: bounds and multiplicity
por: Bergia, S, et al.
Publicado: (1966)

Relations, bounds and approximations for order statistics
por: Arnold, Barry C, et al.
Publicado: (1989)

Relating instance hardness to classification performance in a dataset: a visual approach
por: Paiva, Pedro Yuri Arbs, et al.
Publicado: (2022)

The satisfiability problem /
Publicado: (1999)

Unbalanced but Satisfied?
por: Shenoi, Asha N.
Publicado: (2016)

Easily Satisfied!
Publicado: (1898)

Satisfying journey!
por: Manohar, Balaji
Publicado: (2015)

A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees
por: Iersel, Leo van, et al.
Publicado: (2014)

Computational identification of multiple lysine PTM sites by analyzing the instance hardness and feature importance
por: Ahmed, Sabit, et al.
Publicado: (2021)

Cliques, coloring, and satisfiability
por: Johnson, David S, et al.
Publicado: (1996)

Error metrics determination in functionally approximated circuits using SAT solvers
por: Abed, Sa’ed, et al.
Publicado: (2020)

Complexity and approximation: combinatorial optimization problems and their approximability properties
por: Ausiello, G
Publicado: (1999)

Knowing Each Random Error of Our Ways, but Hardly Correcting for It: An Instance of Optimal Performance
por: van Dam, Loes C. J., et al.
Publicado: (2013)

Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions
por: Semenov, Alexander, et al.
Publicado: (2016)

Lower bounds for the low-rank matrix approximation
por: Li, Jicheng, et al.
Publicado: (2017)

MACHINE PROTECTION CONCERNS SATISFIED
por: Calaga, R
Publicado: (2013)

Satisfy Your Appetite
Publicado: (1889)

Rational approximations and orthogonality
por: Nikishin, E M, et al.
Publicado: (1991)

Satisfied or not satisfied? Electronic health records system implementation in Ghana: Health leaders’ perspective
por: Attafuah, Priscilla Y. A., et al.
Publicado: (2022)

Instance Sequence Queries for Video Instance Segmentation with Transformers
por: Xu, Zhujun, et al.
Publicado: (2021)

Cannot write session to /tmp/vufind_sessions/sess_a8bmvtcd46eldmpmphrfhfv3j8