Pages that link to "Item:Q2475410"

The following pages link to The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs (Q2475410):

Displaying 22 items.

• Separating OR, SUM, and XOR circuits (Q269494) (← links)
• The relative exponential time complexity of approximate counting satisfying assignments (Q309794) (← links)
• A randomized algorithm for 3-SAT (Q626900) (← links)
• Exploiting functional dependencies in declarative problem specifications (Q1028967) (← links)
• Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← links)
• Parameterized random complexity (Q1946497) (← links)
• On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} (Q1949746) (← links)
• Completeness, approximability and exponential time results for counting problems with easy decision version (Q2143122) (← links)
• The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments (Q2946032) (← 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 Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems (Q3448788) (← links)
• The Time Complexity of Constraint Satisfaction (Q3503589) (← links)
• Variable Influences in Conjunctive Normal Forms (Q3637162) (← links)
• The Complexity of Satisfiability of Small Depth Circuits (Q3656852) (← links)
• Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models (Q4969061) (← links)
• (Q5111278) (← links)
• The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
• Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)
• On Super Strong ETH (Q5856463) (← links)
• Approximation algorithms for replenishment problems with fixed turnover times (Q5918783) (← links)
• Some rainbow problems in graphs have complexity equivalent to satisfiability problems (Q6071083) (← links)