NP-Complete decision problems for binary quadratics

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complete Problems for Monotone NP

We show that the problem of deciding whether a digraph has a Hamiltonian path between two specified vertices and the problem of deciding whether a given graph has a cubic subgraph are complete for monotone NP via monotone projection translations. We also show that the problem of deciding whether a uniquely partially orderable (resp. comparability) graph has a cubic subgraph is complete for NP v...

متن کامل

Neural Networks for Np-complete Problems

combinatorial optimization is an active field of research in Neural Networks. Since the first attempts to solve the travelling salesman problem with Hopfield nets several progresses have been made. I will present some Neural Network approximate solutions for NP-complete problems that have a sound mathematical foundation and that, beside their theoretical interest, are also numerically encouragi...

متن کامل

Dimensionality Decrease Heuristics for NP Complete Problems

Introduction The vast majority of scientific community believes that P!=NP, with countless supporting arguments. The number of people who believe otherwise probably amounts to as few as those opposing the 2 Law of Thermodynamics. But isn’t nature elegant enough, not to resource to brute-force search? In this article, a novel concept of dimensionality is presented, which may lead to a more effic...

متن کامل

Optical solution for bounded NP-complete problems.

We present a new optical method for solving bounded (input-length-restricted) NP-complete combinatorial problems. We have chosen to demonstrate the method with an NP-complete problem called the traveling salesman problem (TSP). The power of optics in this method is realized by using a fast matrix-vector multiplication between a binary matrix, representing all feasible TSP tours, and a gray-scal...

متن کامل

NP-Complete Stable Matching Problems

This paper concerns the complexity analysis of the roommate problem and intern assignment problem with couples. These are two special cases of the matching problems known as stable matching. The roommate problem is that of assigning a set of people to rooms of exactly two occupants in accordance with the preferences of the members of the set. The intern assignment problem with couples is that o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 1978

ISSN: 0022-0000

DOI: 10.1016/0022-0000(78)90044-2