Skip to content

cs-conference-ranking.org

By subfield By rank Methodology

⌕ Search 971 venues

Home/SAT/Paper

On the Complexity of k-DQBF.

Long-Hin Fung, Tony Tan

VenueASAT

Year2023

ProceedingsSAT

DBLP recordconf/sat/FungT23 ↗

Browse the full SAT paper archive.

Subfields

Artificial Intelligence
Machine Learning
Computer Vision
Natural Language Processing
Security and Privacy
Systems and Networking
Databases and Data Management
Data Science and Information Retrieval

Rank tiers

A*
A
B
C
National
Regional
Australasian
Unranked
Journal Published
Multiconference

About

Rankings from the CORE Conference Ranking. Publication records from the DBLP computer science bibliography. Not affiliated with either project.

Methodology and sources