Work

Algorithmic complexity of pair cleaning method for k-satisfiability problem. (draft version)

Year: 2011

Type: preprint

Abstract: The k-satisfiability problem is a well-known task in computational complexity theory. In this paper approach for it's solving is introduced.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1108.0408

Author: Kardash, Sergey

Language: English

Topic: Constraint Satisfaction and Optimization

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1746783725

Cites: 1

Cited by: 3

Related to: 10