𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computational complexity of some restricted instances of 3-SAT

✍ Scribed by Piotr Berman; Marek Karpinski; Alexander D. Scott

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
126 KB
Volume
155
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The computational complexity of some fuz
The computational complexity of some fuzzy dynamic programs
✍ A.O. Esogbue πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 292 KB

Fuzzy dynamic programming, a natural extension of classical dynamic programming, is of great appeal in the modeling and control of certain systems, especially those of a socio-technical systems nature. However, data acquisition, manipulation, and processing create immense problems to the systems des

The Computational Complexity of Some Pro
The Computational Complexity of Some Problems of Linear Algebra
✍ Jonathan F Buss; Gudmund S Frandsen; Jeffrey O Shallit πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 330 KB

We consider the computational complexity of some problems dealing with matrix rank. Let E, S be subsets of a commutative ring R. Let x 1 , x 2 , ..., x t be variables. Given a matrix M=M(x 1 , x 2 , ..., x t ) with entries chosen from E \_ [x 1 , x 2 , ..., x t ], we want to determine maxrank S (M)=