Menu
Home
Contact us
Stats
Categories
Calendar
Toggle Wiki
Wiki Home
Last Changes
Rankings
List pages
Orphan pages
Sandbox
Print
Toggle Image Galleries
Galleries
Rankings
Toggle Articles
Articles home
List articles
Rankings
Toggle Blogs
List blogs
Rankings
Toggle Forums
List forums
Rankings
Toggle File Galleries
List galleries
Rankings
Toggle Maps
Mapfiles
Toggle Surveys
List surveys
Stats
ITHEA Classification Structure > G. Mathematics of Computing  > G.2 DISCRETE MATHEMATICS  > G.2.1 Combinatorics 
THE BOUNDARY DESCRIPTORS OF THE n-DIMENSIONAL UNIT CUBE SUBSET PARTITIONING1
By: Hasmik Sahakyan, Levon Aslanyan (3806 reads)
Rating: (1.00/10)

Abstract: The specific class of all monotone Boolean functions with characteristic vectors of partitioning of sets of all true-vertices to be minimal is investigated. These characteristic vectors correspond to the column-sum vectors of special (0,1)-matrices – constructed by the interval bisection method.

Keywords: monotone Boolean functions, (0,1)-matrices.

ACM Classification Keywords: G.2.1 Discrete mathematics: Combinatorics

Link:

THE BOUNDARY DESCRIPTORS OF THE n-DIMENSIONAL UNIT CUBE SUBSET PARTITIONING1

Hasmik Sahakyan, Levon Aslanyan

http://www.foibg.com/ijita/vol13/ijita13-3-p02.pdf

Print
G.2.1 Combinatorics
article: RANDOMIZED SET SYSTEMS CONSTRAINED BY THE DISCRETE TOMOGRAPHY · A NEW ALGORITM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM · ON THE STRUCTURE OF MAXIMUM INDEPENDENT SETS IN BIPARTITE GRAPHS · SOME PROPERTIES IN MULTIDIMENSIONAL MULTIVALUED DISCRETE TORUS · ON PROBLEM OF ADEQUACY OF MULTISET MATHEMATICAL MODELS · SPREADING THE MOORE - PENROSE PSEUDO INVERSE ON MATRICES EUCLIDEAN SPACES: ... · VECTORS AND MATRIXES IN GROUPING INFORMATION PROBLEM · CHOICE OF DIAGNOSTIC DECISION MAKING IN MEDICINE AND INTERVENTION MISTAKE ... · RECURRENT PROCEDURE IN SOLVING THE GROUPING INFORMATION PROBLEM IN APPLIED... · ‘FEATURE VECTORS’ IN GROUPING INFORMATION PROBLEM IN APPLIED MATHEMATICS: .. · DECOMPOSITION METHODS FOR LARGE-SCALE TSP · ON THE DISCRETIZATION OF DISTANCE GEOMETRY PROBLEMS · REGULAR INVERSIVE POLYTOPES · LOGARITHMIC DISTANCES IN GRAPHS · FUZZY SETS AS A MEAN FOR UNCERTAINTY HANDLING: MATH, APPLIED MATH, HEURISTICS · FUZZY SETS: MATH, APPLIED MATH, HEURISTICS? PROBLEMS AND INTERPRETATIONS · CROSS INTERSECTION SEQUEL OF DISCRETE ISOPERIMETRY1 · GENERATING MORE BOUNDARY ELEMENTS OF SUBSET PROJECTIONS · MULTICRITERION PROBLEMS ON THE COMBINATORIAL SET OF POLYARRANGEMENTS · CHAIN SPLIT OF PARTIALLY ORDERED SET OF K-SUBSETS · SOLVING LARGE SYSTEMS OF BOOLEAN EQUATIONS · LAGRANGEAN APPROXIMATION FOR COMBINATORIAL INVERSE PROBLEMS · MULTICRITERION PROBLEMS ON THE COMBINATORIAL SET OF POLYARRANGEMENTS · DESCRIPTION REDUCTION FOR RESTRICTED SETS OF (0,1) MATRICES 1 · DECOMPOSITION OF BOOLEAN FUNCTIONS – RECOGNIZING A GOOD SOLUTION BY TRACES · THE BOUNDARY DESCRIPTORS OF THE n-DIMENSIONAL UNIT CUBE SUBSET PARTITIONING1 · RANDOMIZED PARALLELIZATION – A NEW METHOD FOR SOLVING ... · OPTIMIZATION OF ATM TELECOMMUNICATION NETWORKS · VECTOR COMBINATORIAL PROBLEMS IN A SPACE OF COMBINATIONS ... ·
Login
[ register | I forgot my password ]
World Clock
Powered by Tikiwiki Powered by PHP Powered by Smarty Powered by ADOdb Made with CSS Powered by RDF powered by The PHP Layers Menu System
RSS Wiki RSS Blogs rss Articles RSS Image Galleries RSS File Galleries RSS Forums RSS Maps rss Calendars
[ Execution time: 0.08 secs ]   [ Memory usage: 7.56MB ]   [ GZIP Disabled ]   [ Server load: 0.81 ]
Powered by Tikiwiki CMS/Groupware