Workshop on Satisfiability Siena, Italy on 28 April - 3 May 1996,

Abstract

Partial contents include : (1) 0-1 Threshold for random constant-width formulas; (2) Lagrangian methods; (3) Probabilistic analysis of Davis-Putnam variants; (4) Fixed-parameter-tractable hierarchies of SAT classes; (5) Upper bounds on the complexity of 3-satisfiability; (6) Resolution proof length; (7) Polynomial time solvable subclasses of satisfiability; (8) Partially defined Boolean functions, and (9) Multispace search.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1996
Accession Number
ADA325947

Entities

People

  • Cosimo Spera
  • Ewald Speckenmeyer
  • Giogio Gallo
  • Hans K. Buening
  • John Franco

Organizations

  • University of Cincinnati

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Applied Mathematics
  • Artificial Intelligence
  • Computations
  • Computer Programming
  • Computer Science
  • Computers
  • Hard Copy
  • Hierarchies
  • Linear Programming
  • North America
  • Operations Research
  • Polynomials
  • Probability
  • Probability Distributions
  • Simplex Method

Fields of Study

  • Computer science

Readers

  • Graph Algorithms and Convex Optimization.
  • Mathematical Modeling and Probability Theory.
  • Operations Research