A new upper bound for Max-2-SAT: A graph-theoretic approach-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A new upper bound for Max-2-SAT: A graph-theoretic approach

Published:2010-12 Issue:4 Volume:8 Page:388-401
ISSN:1570-8667
Container-title:Journal of Discrete Algorithms
language:en
Short-container-title:Journal of Discrete Algorithms

Author:

Binkele-Raible Daniel,Fernau Henning

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference20 articles.

1. Searching trees: an essay;Fernau,2009

2. A measure & conquer approach for the analysis of exact algorithms;Fomin;Journal of the ACM,2009

3. A universally fastest algorithms for Max 2-Sat, Max 2-CSP, and everything in between;Gaspers,2009

4. Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT;Gramm;Discrete Applied Mathematics,2003

5. Faster exact solutions for MAX2SAT;Gramm,2000

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improved exact algorithms for mildly sparse instances of Max SAT;Theoretical Computer Science;2017-10

2. The New Directed Hypergraph for CNF Formula of Propositional Logic;2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE);2015-11

3. Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction;Theory of Computing Systems;2014-12-23

4. New exact algorithms for the 2-constraint satisfaction problem;Theoretical Computer Science;2014-03

5. Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction;Lecture Notes in Computer Science;2014

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP