Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle?
10.4230/LIPIcs.ICALP.2023.123
Saved in:
Main Authors: | Chakraborty, Diptarka, Chakraborty, Sourav, Kumar, Gunjan, Meel, Kuldeep S |
---|---|
Other Authors: | DEPARTMENT OF COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
schloss dagstuhl- leibniz-zentrum fur informatik gmbh, dagstuhl publishing
2023
|
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/243040 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Pairwise Reachability Oracles and Preservers Under Failures.
by: Chakraborty, Diptarka, et al.
Published: (2024) -
An optical fiber network oracle for NP-complete problems
by: Shum, Perry Ping, et al.
Published: (2015) -
Pairwise Reachability Oracles and Preservers Under Failures
by: Chakraborty, D, et al.
Published: (2023) -
Ajax in Oracle JDeveloper
by: Vohra, Deepak
Published: (2017) -
On Bayesian oracle properties
by: Jiang, W., et al.
Published: (2022)