Pages that link to "Item:Q790612"
From MaRDI portal
The following pages link to A simplified NP-complete satisfiability problem (Q790612):
Displaying 49 items.
- Une famille d'algorithmes polynomiaux pour la résolution de classes d'instances du problème SAT. (A family of polynomial algorithms for the solution of classes of instances of the SAT problem) (Q3985743) (← links)
- Complexity of satisfiability problems with symmetric polynomial clauses (Q4344698) (← links)
- On generating all solutions of generalized satisfiability problems (Q4389761) (← links)
- A Complexity Dichotomy for the Coloring of Sparse Graphs (Q4920652) (← links)
- The Monotone Satisfiability Problem with Bounded Variable Appearances (Q4963262) (← links)
- (Q4989405) (← links)
- Reachability Switching Games (Q5002810) (← links)
- Destroying Bicolored $P_3$s by Deleting Few Edges (Q5038193) (← links)
- (Q5090494) (← links)
- (Q5090992) (← links)
- Packing Arc-Disjoint Cycles in Tournaments (Q5092386) (← links)
- (Q5092402) (← links)
- (Q5092419) (← links)
- Non-strict Temporal Exploration (Q5100955) (← links)
- The 2CNF Boolean formula satisfiability problem and the linear space hypothesis (Q5111278) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5111704) (← links)
- (Q5111862) (← links)
- Tight Lower Bounds for List Edge Coloring (Q5116492) (← links)
- Planar 3-SAT with a clause/variable cycle (Q5116495) (← links)
- The complexity of satisfiability problems (Q5402560) (← links)
- (Q5687692) (← links)
- Approximating Minimum Representations of Key Horn Functions (Q5863327) (← links)
- Bounding the running time of algorithms for scheduling and packing problems (Q5890508) (← links)
- Collaborative delivery on a fixed path with homogeneous energy-constrained agents (Q5896883) (← links)
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors (Q5918315) (← links)
- Optimality program in segment and string graphs (Q5920196) (← links)
- Load balancing for redundant storage strategies: Multiprocessor scheduling with machine eligibility (Q5952430) (← links)
- When removing an independent set is optimal for reducing the chromatic number (Q6057453) (← links)
- Discriminating Codes in Geometric Setups (Q6065423) (← links)
- Finding Temporal Paths Under Waiting Time Constraints. (Q6065432) (← links)
- On the hull number on cycle convexity of graphs (Q6072203) (← links)
- Parameterized complexity of finding a spanning tree with minimum reload cost diameter (Q6087398) (← links)
- On finding the best and worst orientations for the metric dimension (Q6093374) (← links)
- Complexity and approximation for discriminating and identifying code problems in geometric setups (Q6107885) (← links)
- The Exact Subset MultiCover problem (Q6111957) (← links)
- Packing arc-disjoint cycles in oriented graphs (Q6126480) (← links)
- The \textsc{Red-Blue Separation} problem on graphs (Q6168089) (← links)
- Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles (Q6174144) (← links)
- Refined computational complexities of hospitals/residents problem with regional caps (Q6201324) (← links)
- Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs (Q6489319) (← links)
- Bandwidth-Hard Functions: Reductions and Lower Bounds (Q6489332) (← links)
- Theoretical Analysis of Git Bisect (Q6492083) (← links)
- On the parameterized complexity of interval scheduling with eligible machine sets (Q6564614) (← links)
- Hardness of the generalized coloring numbers (Q6614401) (← links)
- On the complexity of minimum maximal acyclic matchings (Q6621851) (← links)
- Polarised random \(k\)-SAT (Q6632785) (← links)
- The \textsc{Exact Subset MultiCover} problem (Q6652461) (← links)
- Dichotomies for tree minor containment with structural parameters (Q6658295) (← links)
- Payment scheduling in the interval debt model (Q6664057) (← links)
