Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    almahu_9949218783002882
    Format: 1 online resource (xv, 724 p. : ill.)
    Edition: Electronic reproduction. Providence, Rhode Island : American Mathematical Society. 2012
    ISBN: 9781470439934 (online)
    Series Statement: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, v. 35
    Note: "NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science. A consortium of Rutgers University, Princeton University, AT&T Labs, Bell Labs, and Bellcore." , Finding hard instances of the satisfiability problem: A survey , Algorithms for the satisfiability (SAT) problem: A survey , Backtracking and probing , Relative size of certain polynomial time solvable subclasses of satisfiability , Complexity of hierarchically and 1-dimensional periodically specified problems. I: Hardness results , Worst-case analysis, 3-SAT decision, and lower bounds: Approaches for improved SAT algorithms , Satisfiability of 3CNF formulas with small clause/variable-ratio , Propositional search efficiency and first-order theorem proving , Branching rules for propositional satisfiability test , A discrete Lagrangian-based global-search method for solving satisfiability problems , Approximate solution of weighted MAX-SAT problems using GRASP , Multispace search for satisfiability and NP-hard problems , A branch and cut algorithm for MAX-SAT and weighted MAX-SAT , Surrogate constraint analysis -- new heuristics and learning schemes for satisfiability problems , A general stochastic approach to solving problems with hard and soft constraints , Some fundamental properties of Boolean ring normal forms , The polynomial time decidability of simulation relations for finite state processes: A HORNSAT based approach , A better upper bound for the unsatisfiability threshold , Solving MAX-SAT with nonoblivious functions and history-based heuristics , On the imbalance of distributions of solutions of CNF formulas and its impact on satisfiability solvers , On the use of second order derivatives for the satisfiability problem , Local search for channel assignment in cellular mobile networks , A GRASP clustering technique for circuit partitioning , Mode of access : World Wide Web
    Additional Edition: Print version: Satisfiability problem : ISSN 1052-1798 ISBN 9780821804797
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages