Algorithms for the Satisfiability Problem

Algorithms for the Satisfiability Problem pdf epub mobi txt 电子书 下载 2025

出版者:Cambridge Univ Pr
作者:Gu, Jun/ Purdom, Paul W./ Franco, John/ Wah, Benjamin W.
出品人:
页数:250
译者:
出版时间:1999-6
价格:$ 50.79
装帧:HRD
isbn号码:9780521640411
丛书系列:
图书标签:
  •  
想要找书就要到 图书目录大全
立刻按 ctrl+D收藏本页
你会得到大惊喜!!

The satisfiability (SAT) problem is central in mathematical logic and computing theory, representing a core of computationally intractable NP-complete problems. It is a fundamental hurdle in solving many problems in automated reasoning, computer-aided design, computer-aided manufacturing, machine vision, database construction and maintenance, robotics, scheduling, integrated circuit design, computer architecture design, and computer networking. Efficient methods for solving the SAT problem play an important role in the development of practical computing systems. Traditional methods treat SAT as a discrete, constrained decision problem. In recent years, many optimization methods, parallel algorithms, and other practical new techniques have been developed for solving the SAT problem. This book describes these state-of-the-art methods, both sequential and parallel, and discusses tradeoffs and limitations in the rapidly growing field of satisfiability testing. It will be useful for computer theorists, algorithmists, and practitioners working in all areas in computer science, computer engineering, operations research, and applied logic.

具体描述

读后感

评分

评分

评分

评分

评分

用户评价

评分

评分

评分

评分

评分

本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度google,bing,sogou

© 2025 book.wenda123.org All Rights Reserved. 图书目录大全 版权所有