Pages that link to "Item:Q3656852"
From MaRDI portal
The following pages link to The Complexity of Satisfiability of Small Depth Circuits (Q3656852):
Displayed 43 items.
- Separating OR, SUM, and XOR circuits (Q269494) (← links)
- A satisfiability algorithm and average-case hardness for formulas over the full binary basis (Q354655) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- Algorithmic analysis of priority-based bin packing (Q831745) (← links)
- Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
- Computational complexity of distance edge labeling (Q1647838) (← links)
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144) (← links)
- On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} (Q1949746) (← links)
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search (Q2074664) (← links)
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- New exact algorithms for the 2-constraint satisfaction problem (Q2437759) (← links)
- A note on the complexity of computing the number of reachable vertices in a digraph (Q2629773) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem (Q2946352) (← links)
- On the Exact Complexity of Evaluating Quantified k-CNF (Q3058691) (← links)
- Nonuniform ACC Circuit Lower Bounds (Q3189637) (← links)
- Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP (Q3453207) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q4588848) (← links)
- (Q4638056) (← links)
- (Q4638059) (← links)
- (Q4638096) (← links)
- (Q5002674) (← links)
- On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection (Q5041250) (← links)
- On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) (Q5062116) (← links)
- The Orthogonal Vectors Conjecture for Branching Programs and Formulas (Q5090426) (← links)
- Testing the Complexity of a Valued CSP Language (Q5091236) (← links)
- On the Complexity of Bounded Context Switching. (Q5111714) (← links)
- (Q5121902) (← links)
- Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs (Q5136279) (← links)
- Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)
- Counting Solutions to Polynomial Systems via Reductions (Q5240420) (← links)
- (Q5743451) (← links)
- On Super Strong ETH (Q5856463) (← links)
- (Q5863854) (← links)
- Elastic-Degenerate String Matching via Fast Matrix Multiplication (Q5864665) (← links)
- Fine-grained complexity of safety verification (Q5919003) (← links)
- Solving cut-problems in quadratic time for graphs with bounded treewidth (Q6114456) (← links)
- Priority-based bin packing with subset constraints (Q6184311) (← links)