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

Stefano Varotti

dblp:205/3632 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
—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
Automated reasoning and model checking · 64% Quantum computing and quantum information · 28% Mathematical optimization · 8%

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

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information › quantum computational models
quantum annealing
0.412020
Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results · Inf. Comput. 2020
Automated reasoning and model checking
satisfiability
0.412020
Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results · Inf. Comput. 2020
Automated reasoning and model checking › satisfiability
SAT solving
0.412020
Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results · Inf. Comput. 2020
Mathematical optimization
combinatorial optimization
0.112020
Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results · Inf. Comput. 2020
Automated reasoning and model checking › satisfiability
maximum satisfiability
0.112020
Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results · Inf. Comput. 2020

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

quantum annealing · 0.4
YearPublicationVenuePosition
2020 Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results
Zhengbing Bian, Fabián A. Chudak, William G. Macready, Aidan Roy, Roberto Sebastiani, Stefano Varotti
Inf. Comput.6