Pages that link to "Item:Q1949745"

The following pages link to Chris Calabro (Q1949745):

Displaying 5 items.

• On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} (Q1949746) (← links)
• The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs (Q2475410) (← links)
• On the Exact Complexity of Evaluating Quantified k-CNF (Q3058691) (← links)
• k-SAT Is No Harder Than Decision-Unique-k-SAT (Q3392942) (← links)
• The Complexity of Satisfiability of Small Depth Circuits (Q3656852) (← links)