Generalized CNF satisfiability, local reductions and complexity of succinctly specified problems

Generalized CNF satisfiability, local reductions and complexity of succinctly specified problems [electronic resource]

We, study the complexity and efficient approximability of various decision, counting and optimization problems when instances are specified using (1) the 1-dimensional finite periodic narrow specifications of Wanke, (2) the 2-way infinite 1-dimensional narrow periodic (sometimes called dynamic) spec...

Full description

Saved in:
Bibliographic Details
Online Access: Online Access
Corporate Author: Los Alamos National Laboratory (Researcher)
Format: Government Document Electronic eBook
Language:English
Published: Washington, D.C. : Oak Ridge, Tenn. : United States. Dept. of Energy ; distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy, 1995.
Subjects:
Nonlinear Problems.
Algorithms.
Computer Calculations.
Probability.
Set Theory.
General And Miscellaneous//mathematics, Computing, And Information Science.

Internet

Online Access

Online

Holdings details from Online
Call Number: E 1.99:CONF-9505175--1
E 1.99:CONF-9505175--1 Available

Similar Items