On the public citation graph

An Introduction to Discrete Mathematics.

0 signed · 118 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/mpev.1998.0522openalex-snapshot
The Number of Multiple Alignments
inferred← citeshttps://doi.org/10.1007/3-540-18740-5_2openalex-snapshot
Functional systems on semilattices
inferred← citeshttps://doi.org/10.1007/978-1-4615-4102-8_9openalex-snapshot
Some Recent Developments of Using Logical Analysis for Inferring a Boolean Function with Few Clauses
inferred← citeshttps://doi.org/10.1007/978-3-030-60577-3_46openalex-snapshot
Development of the Learning Logic Gate for Optimization of Neural Networks at the Hardware Level
inferred← citeshttps://doi.org/10.1007/978-3-030-65596-9_27openalex-snapshot
Algorithm for Constructing Logical Operations to Identify Patterns in Data
inferred← citeshttps://doi.org/10.1007/978-94-009-1606-7_14openalex-snapshot
Fault Detection in Parts of the Circuits of Functional Elements
inferred← citeshttps://doi.org/10.1007/978-94-009-5991-0_2openalex-snapshot
M
inferred← citeshttps://doi.org/10.1007/bf00973062openalex-snapshot
The problem of constructing reduced disjunctive normal forms of Boolean functions from the point of view of lattice theory
inferred← citeshttps://doi.org/10.1007/bf01068570openalex-snapshot
Models of the general theory of test construction of relatively constant malfunctions
inferred← citeshttps://doi.org/10.1007/bf01070364openalex-snapshot
Automaton models of swapping and replacement systems for computer memory
inferred← citeshttps://doi.org/10.1007/bf02366313openalex-snapshot
Functional completeness criteria in Dijkstra algebra
inferred← citeshttps://doi.org/10.1007/bf02671629openalex-snapshot
Simple iterative algebras
inferred← citeshttps://doi.org/10.1007/bf02674199openalex-snapshot
On superpositions of continuous functions defined on the baire space
inferred← citeshttps://doi.org/10.1007/bf02742065openalex-snapshot
Functional completeness in iterative meta-algebras
inferred← citeshttps://doi.org/10.1007/s11006-005-0185-xopenalex-snapshot
On the Cardinality of the Family of Precomplete Classes in P E
inferred← citeshttps://doi.org/10.1007/s11202-007-0038-9openalex-snapshot
On the α-superposition of functions of a k-valued logic
inferred← citeshttps://doi.org/10.1007/s11786-017-0310-8openalex-snapshot
Applications of CAS in the Teaching and Learning of Discrete Mathematics
inferred← citeshttps://doi.org/10.1016/0020-0255(96)00082-5openalex-snapshot
Interactive learning of monotone Boolean functions
inferred← citeshttps://doi.org/10.1016/0026-2714(94)90094-9openalex-snapshot
A technique of realization for one class of two-testable k-valued logic elements
inferred← citeshttps://doi.org/10.1016/0026-2714(94)90288-7openalex-snapshot
Computation availability of crossbar systems in a non-uniform traffic environment
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)39607-6openalex-snapshot
Estimation of Multilayer Neural Network Plasticity
inferred← citeshttps://doi.org/10.1023/a:1015142527070openalex-snapshot
Metric Properties of Factor Space of Molecular Shapes
inferred← citeshttps://doi.org/10.1080/0020739x.2016.1267807openalex-snapshot
Efficient remainder rule
inferred← citeshttps://doi.org/10.1109/iscas.2002.1010509openalex-snapshot
Using a spectral technique, genetic algorithms and decision diagrams for finding unconditional table tests
inferred← citeshttps://doi.org/10.1134/s0001434609090284openalex-snapshot
Orders of discriminator classes in multivalued logic
inferred← citeshttps://doi.org/10.1134/s0001434620030323openalex-snapshot
Short Tests of Closures for Contact Circuits
inferred← citeshttps://doi.org/10.1134/s0001434622010187openalex-snapshot
On Self-Correcting Logic Circuits of Unreliable Gates with at Most Two Inputs
inferred← citeshttps://doi.org/10.1134/s0001434623010091openalex-snapshot
Short Complete Diagnostic Tests for Circuits Implementing Linear Boolean Functions
inferred← citeshttps://doi.org/10.1134/s0001434624010073openalex-snapshot
Implementation of Linear Boolean Functions by Self-Correcting Circuits of Unreliable Logic Gates
inferred← citeshttps://doi.org/10.1134/s0001434625602813openalex-snapshot
Short Single-Fault Tests for Circuits in the Zhegalkin Basis with Arbitrary Stuck-At Faults of Gates
inferred← citeshttps://doi.org/10.1134/s0081543811020040openalex-snapshot
Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning
inferred← citeshttps://doi.org/10.1134/s0081543818040223openalex-snapshot
Algebras of Probability Distributions on Finite Sets
inferred← citeshttps://doi.org/10.1134/s0965542517050116openalex-snapshot
Upper bound for the length of functions over a finite field in the class of pseudopolynomials
inferred← citeshttps://doi.org/10.1134/s1054661807030029openalex-snapshot
Constructing irreducible coverings of a Boolean matrix
inferred← citeshttps://doi.org/10.1134/s1054661816030044openalex-snapshot
Multilevel models for solution of multiclass recognition problems
inferred← citeshttps://doi.org/10.1134/s1064230706030142openalex-snapshot
Complexity of Boolean functions in intelligent systems for synthesis of digital integrated circuits
inferred← citeshttps://doi.org/10.1134/s1064230709050062openalex-snapshot
Decomposition representations of logical equations in problems of inversion of discrete functions
inferred← citeshttps://doi.org/10.1134/s106423071105011xopenalex-snapshot
Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem
inferred← citeshttps://doi.org/10.1134/s1064230720030132openalex-snapshot
Synthesis-Analysis of Derivation Sequences of Tables’ Functional Dependences
inferred← citeshttps://doi.org/10.1134/s1064562407020305openalex-snapshot
Polynomial-delay construction of irreducible coverings of a Boolean matrix
inferred← citeshttps://doi.org/10.1134/s1064562408020324openalex-snapshot
Strong closure operators on the set of partial Boolean functions
inferred← citeshttps://doi.org/10.1134/s1064562409030223openalex-snapshot
On solutions to systems of functional equations of multiple-valued logic
inferred← citeshttps://doi.org/10.1134/s1064562411040260openalex-snapshot
Asymptotic representations of series and some questions of number theory
inferred← citeshttps://doi.org/10.1134/s1064562411070064openalex-snapshot
Selection of informative feature values on the basis of solvability criteria in the problem of protein secondary structure recognition
inferred← citeshttps://doi.org/10.1134/s1560354717080032openalex-snapshot
The Second Term in the Asymptotics for the Number of Points Moving Along a Metric Graph
inferred← citeshttps://doi.org/10.1134/s1990478907040114openalex-snapshot
A criterion for positive completeness in ternary logic
inferred← citeshttps://doi.org/10.1134/s1990478908040108openalex-snapshot
Discriminator positively complete classes of ternary logic
inferred← citeshttps://doi.org/10.1134/s1990478911030100openalex-snapshot
The closure operator in a multivalued logic based on functional equations
inferred← citeshttps://doi.org/10.1134/s1990478917020065openalex-snapshot
Asymptotic approximation for the number of n-vertex graphs of given diameter
inferred← citeshttps://doi.org/10.1134/s1990478919040161openalex-snapshot
On a Relation Between the Depth and Complexity of Monotone Boolean Formulas
inferred← citeshttps://doi.org/10.1145/3458768openalex-snapshot
Reliability-aware Scheduling and Routing for Messages in Time-sensitive Networking
inferred← citeshttps://doi.org/10.15388/infedu.2010.10openalex-snapshot
The Recurrence Relations in Teaching Students of Informatics
inferred← citeshttps://doi.org/10.15407/dopovidi2017.03.018openalex-snapshot
Мінімізація КНФ частково-монотонних булевих функцій
inferred← citeshttps://doi.org/10.17586/2226-1494-2019-19-4-704-713openalex-snapshot
Pattern recognition in expert decision-making systems
inferred← citeshttps://doi.org/10.18287/2223-9537-2016-6-1-106-124openalex-snapshot
EVERGETIC AND ONTOLOGIES OF MANAGEMENT
inferred← citeshttps://doi.org/10.18287/2223-9537-2016-6-1-29-38openalex-snapshot
MATHEMATICAL FOUNDATION OF BINARY SYSTEM ONTOLOGY FOR DATA PROCESSING
inferred← citeshttps://doi.org/10.18287/2223-9537-2016-6-1-67-80openalex-snapshot
ABOUT THE CLASS, CLASSIFICATION AND SYSTEMATIZATION
inferred← citeshttps://doi.org/10.18287/2223-9537-2016-6-1-7-28openalex-snapshot
ONTOLOGY OF DESIGNING INDUSTRIAL EQUIPMENT WITHIN THE AVIATION PRODUCTION
inferred← citeshttps://doi.org/10.18287/2223-9537-2016-6-1-81-94openalex-snapshot
COMPARISON OF CONCEPT DESIGN, DESIGNING AND PROJECT ACTIVITY: HISTORICAL, ETYMOLOGICAL AND EPISTEMOLOGICAL ASPECTS
inferred← citeshttps://doi.org/10.18287/2223-9537-2016-6-1-95-105openalex-snapshot
MOVEMENT AS A CATEGORY OF ARCHITECTURE
inferred← citeshttps://doi.org/10.20295/2412-9186-2022-8-04openalex-snapshot
inferred← citeshttps://doi.org/10.21638/spbu01.2021.302openalex-snapshot
The symptom-syndrome analysis of multivariate categorical data based on Zhegalkin polynomials
inferred← citeshttps://doi.org/10.22405/2226-8383-2022-23-4-11-19openalex-snapshot
Rational A-functions with rational coefficients
inferred← citeshttps://doi.org/10.22405/2226-8383-2023-24-1-5-14openalex-snapshot
Closed classes in the functional system of polynomials with real coefficients
inferred← citeshttps://doi.org/10.26089/nummet.v20r106openalex-snapshot
Duplicates of conflict clauses in CDCL derivation and their usage to invert some cryptographic functions
inferred← citeshttps://doi.org/10.26456/fssc65openalex-snapshot
Order alteration in a cascade-ordered set
inferred← citeshttps://doi.org/10.26456/fssc78openalex-snapshot
Hygiene of derivation sequences
inferred← citeshttps://doi.org/10.26456/fssc96openalex-snapshot
The spatial logic of the conflict of convex sets
inferred← citeshttps://doi.org/10.3103/s0027132207030047openalex-snapshot
Synthesis of formulas whose complexity and depth do not exceed the asymptotically best estimates of high degree of accuracy
inferred← citeshttps://doi.org/10.3103/s0027132207030060openalex-snapshot
Synthesis of easily tested circuits in some infinite basis
inferred← citeshttps://doi.org/10.3103/s0027132208040098openalex-snapshot
Closed classes generated by symmetric functions in the three-valued logic
inferred← citeshttps://doi.org/10.3103/s0027132209010082openalex-snapshot
Classes generated by monotone symmetric functions in the three-valued logic
inferred← citeshttps://doi.org/10.3103/s0027132209010094openalex-snapshot
The number of S-precomplete classes in the functional system P τ κ
inferred← citeshttps://doi.org/10.3103/s0027132209020119openalex-snapshot
Depth of α-completions of systems of Boolean functions
inferred← citeshttps://doi.org/10.3103/s0027132209050052openalex-snapshot
Equivalent transformations of formulas in P 2
inferred← citeshttps://doi.org/10.3103/s0027132211040097openalex-snapshot
Easily tested circuits for linear functions
inferred← citeshttps://doi.org/10.3103/s0027132211060076openalex-snapshot
The minimal circuits for linear Boolean functions
inferred← citeshttps://doi.org/10.3103/s002713221106009xopenalex-snapshot
Unit checking output tests under constant faults for functional elements
inferred← citeshttps://doi.org/10.3103/s0027132211060118openalex-snapshot
A sequence of functions of the multi-valued logic
inferred← citeshttps://doi.org/10.3103/s0027132212040043openalex-snapshot
Complexity of realization of functions from a class of three-valued logic by formulas of special type
inferred← citeshttps://doi.org/10.3103/s0027132213020083openalex-snapshot
Complexity of realization of a linear Boolean function in Sheffer’s basis
inferred← citeshttps://doi.org/10.3103/s0027132213020113openalex-snapshot
Uniformity of a certain systems of functions of many-valued logic
inferred← citeshttps://doi.org/10.3103/s0027132213040049openalex-snapshot
Single fault detection tests for circuits of functional elements
inferred← citeshttps://doi.org/10.3103/s0027132213040098openalex-snapshot
Certain properties of generalized α-formulas
inferred← citeshttps://doi.org/10.3103/s0027132217020012openalex-snapshot
Classes of functions of multi-valued logic closed with respect to superposition and inversion operations
inferred← citeshttps://doi.org/10.3103/s0027132217020048openalex-snapshot
Estimates for the number of Boolean functions realized by an initial Boolean automaton with three constant states
inferred← citeshttps://doi.org/10.3103/s0027132219040077openalex-snapshot
Minimal Complete Fault Detection Tests for Circuits of Functional Elements in Standard Basis
inferred← citeshttps://doi.org/10.3103/s0027132219060056openalex-snapshot
Quasiuniversal Boolean Automaton with Four Constant States
inferred← citeshttps://doi.org/10.3103/s002713222203007xopenalex-snapshot
Refined Bounds on Shannon’s Function for Complexity of Circuits of Functional Elements
inferred← citeshttps://doi.org/10.3103/s0027132222050072openalex-snapshot
Short Complete Diagnostic Tests for Logic Circuits in One Infinite Basis
inferred← citeshttps://doi.org/10.3103/s0278641908030059openalex-snapshot
Positively closed classes of partial Boolean functions
inferred← citeshttps://doi.org/10.3103/s0278641908030060openalex-snapshot
On the complexity of generalized polynomials of k-valued functions
inferred← citeshttps://doi.org/10.3103/s0278641909030078openalex-snapshot
On the synthesis of oriented contact circuits with certain restrictions on adjacent contacts
inferred← citeshttps://doi.org/10.3103/s0278641909040049openalex-snapshot
Solutions to the systems of functional equations of multivalued logic
inferred← citeshttps://doi.org/10.3103/s0278641910040060openalex-snapshot
Read-once functions with hard-to-test projections
inferred← citeshttps://doi.org/10.3103/s0278641911020063openalex-snapshot
FE classification of functions of many-valued logic
inferred← citeshttps://doi.org/10.3103/s0278641911030034openalex-snapshot
The complexity of recognizing the preservation of some sets by multivalued functions represented by polynomials
inferred← citeshttps://doi.org/10.3103/s0278641911040091openalex-snapshot
Iteration operators on a set of continuous functions of Baire space
inferred← citeshttps://doi.org/10.3103/s0278641912010050openalex-snapshot
On stationary classes of three-value logic functions
inferred← citeshttps://doi.org/10.3103/s027864191203003xopenalex-snapshot
On orders of closed classes containing a homogeneous switching function
inferred← citeshttps://doi.org/10.3103/s0278641912030041openalex-snapshot
A lower estimate of the complexity of three-valued logic functions in the class of polarized polynomials
inferred← citeshttps://doi.org/10.3103/s0278641912030053openalex-snapshot
On the distribution of three-valued functions over pre-complete classes
inferred← citeshttps://doi.org/10.3103/s0278641913020052openalex-snapshot
Structure of stationary classes of three-value logic functions
inferred← citeshttps://doi.org/10.3103/s0278641913030072openalex-snapshot
Delays of schemes in a model that considers the input values of functional elements
inferred← citeshttps://doi.org/10.3103/s0278641913030084openalex-snapshot
The FE-closure operator in countable-valued logic
inferred← citeshttps://doi.org/10.3103/s0278641913040055openalex-snapshot
Network delay in a model with inputs of functional elements
inferred← citeshttps://doi.org/10.3103/s0278641914020083openalex-snapshot
On the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
inferred← citeshttps://doi.org/10.3103/s0278641915010069openalex-snapshot
On the multiplicative complexity of quasi-quadratic Boolean functions
inferred← citeshttps://doi.org/10.3103/s0278641915020053openalex-snapshot
On the enumeration closure operator in multivalued logic
inferred← citeshttps://doi.org/10.3103/s027864192201006xopenalex-snapshot
Multiaffinity Testing of Boolean Functions Using Their Zhegalkin Polynomials
inferred← citeshttps://doi.org/10.3103/s1066369x11020071openalex-snapshot
The lower neighborhoods problem in a space with closure and a finitary theorem
inferred← citeshttps://doi.org/10.3103/s1066369x12020028openalex-snapshot
Reliability of nonbranching programs in an arbitrary complete finite basis
inferred← citeshttps://doi.org/10.3103/s1066369x14050041openalex-snapshot
Upper bounds for the formula size of symmetric Boolean functions
inferred← citeshttps://doi.org/10.3103/s1066369x18050018openalex-snapshot
Asymptotically Optimal in Reliability Circuits in Two Bases Under Failures of 0 (k − 1) Type at the Outputs of Elements
inferred← citeshttps://doi.org/10.3103/s1066369x22050048openalex-snapshot
Theories of Propositional Logics and the Converse of Substitution
inferred← citeshttps://doi.org/10.3103/s11968-008-1006-5openalex-snapshot
Synthesis of easily-tested circuits in the case of single-type constant malfunctions at the element outputs
inferred← citeshttps://doi.org/10.3233/faia240146openalex-snapshot
On Some Properties of Maximal Prefix Codes and Machine Learning for Automata
inferred← citeshttps://doi.org/10.33048/daio.2019.26.643openalex-snapshot
On a relation between the depth and complexity of monotone Boolean formulas
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.