Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Ignacio García-Marco
Daniel P. Kennedy
Barbara Aquilani
Daisei Uchida
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Chen Ma
Priyamvada Tewari
Home
/
Author
/
TOMÁS PEITL
Author Info
Open Visualization
Name
Affiliation
Papers
TOMÁS PEITL
TU Wien, Algorithms & Complex Grp, Vienna, Austria
14
Collaborators
Citations
PageRank
9
6
4.82
Referers
Referees
References
10
79
100
Publications (14 rows)
Collaborators (9 rows)
Referers (10 rows)
Referees (79 rows)
Title
Citations
PageRank
Year
Finding the Hardest Formulas for Resolution (Extended Abstract).
0
0.34
2021
Finding the Hardest Formulas for Resolution
0
0.34
2021
Davis and Putnam Meet Henkin: Solving DQBF with Resolution
0
0.34
2021
Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths.
0
0.34
2020
Hard QBFs for Merge Resolution
0
0.34
2020
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters.
0
0.34
2020
Finding the Hardest Formulas for Resolution
0
0.34
2020
Combining Resolution-Path Dependencies with Dependency Learning.
0
0.34
2019
Proof Complexity of Fragments of Long-Distance Q-Resolution.
0
0.34
2019
Qute in the QBF Evaluation 2018.
0
0.34
2019
Long-Distance Q-Resolution with Dependency Schemes
0
0.34
2019
Polynomial-Time Validation of QCDCL Certificates.
0
0.34
2018
Dependency learning for QBF
3
0.39
2017
Long Distance Q-Resolution with Dependency Schemes.
3
0.37
2016
1