Non-Orthodox Combinatorial Models Based on Discordant Structures - Computer Science > Data Structures and AlgorithmsReport as inadecuate




Non-Orthodox Combinatorial Models Based on Discordant Structures - Computer Science > Data Structures and Algorithms - Download this document for free, or read online. Document in PDF available to download.

Abstract: This paper introduces a novel method for compact representation of sets ofn-dimensional binary sequences in a form of compact triplets structures CTS,supposing both logic and arithmetic interpretations of data. Suitableillustration of CTS application is the unique graph-combinatorial model for theclassic intractable 3-Satisfiability problem and a polynomial algorithm for themodel synthesis. The method used for Boolean formulas analysis andclassification by means of the model is defined as a bijective mappingprinciple for sets of components of discordant structures to a basic set. Thestatistic computer-aided experiment showed efficiency of the algorithm in alarge scale of problem dimension parameters, including those that makeenumeration procedures of no use. The formulated principle expands resources ofconstructive approach to investigation of intractable problems.



Author: V. F. Romanov

Source: https://arxiv.org/







Related documents