Shoma Tate

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

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

Theory of computation · 1

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
Computational complexity · 100%

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

TopicWeightPapersLastEvidence papers
Computational complexity
boolean function complexity
0.412019
On XOR lemmas for the weight of polynomial threshold functions · Inf. Comput. 2019
Computational complexity › boolean function analysis
polynomial threshold function
0.412019
On XOR lemmas for the weight of polynomial threshold functions · Inf. Comput. 2019

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

XOR lemma · 0.4
YearPublicationVenuePosition
2019 On XOR lemmas for the weight of polynomial threshold functions
Kazuyuki Amano, Shoma Tate
Inf. Comput.2