Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jordan D. Denev

dblp:09/10570 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1980
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 77% Logic in computer science · 23%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
boolean functions
0.011980
On the number of equivalence classes of Boolean functions under a transformation group (Corresp.) · IEEE Trans. Inf. Theory 1980
Logic in computer science › algebraic logic › boolean algebra
boolean function classification
0.011980
On the number of equivalence classes of Boolean functions under a transformation group (Corresp.) · IEEE Trans. Inf. Theory 1980

Methods — techniques the papers use, named apart from their topics

group action analysis · 0.0asymptotic enumeration · 0.0
YearPublicationVenuePosition
1980 On the number of equivalence classes of Boolean functions under a transformation group (Corresp.)
abstract
An asymptotic estimate is established for the number of equivalence classes of Boolean functions ofnvariables under transformations of the formf(x) \rightarrow f(Ax+b)+ L(x), wherex=(x_{l}, \cdots ,x_{n}), Ais a nonsingularnbynmatrix,bis a vector, andL(x)is a linear function.
Jordan D. Denev, Vladimir D. Tonchev
IEEE Trans. Inf. Theory1