Pages that link to "Item:Q790612"

The following pages link to A simplified NP-complete satisfiability problem (Q790612):

Displaying 50 items.

• On the r,s-SAT satisfiability problem and a conjecture of Tovey (Q1822964) (← links)
• The computational difficulty of manipulating an election (Q1824524) (← links)
• A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
• Finding temporal paths under waiting time constraints (Q1979453) (← links)
• Sliding window temporal graph coloring (Q2037193) (← links)
• On the complexity of algorithms for detecting \(k\)-length negative cost cycles (Q2051903) (← links)
• Hamiltonian problems in directed graphs with simple row patterns (Q2143132) (← links)
• The \textsc{red-blue separation} problem on graphs (Q2169962) (← links)
• Placing quantified variants of 3-SAT and \textsc{not-all-equal} 3-SAT in the polynomial hierarchy (Q2182311) (← links)
• Maximum reachability preserved graph cut (Q2202008) (← links)
• Assigning times to minimise reachability in temporal graphs (Q2208254) (← links)
• On the edge capacitated Steiner tree problem (Q2218647) (← links)
• On simplified NP-complete variants of \textsc{Monotone} 3\textsc{-Sat} (Q2223685) (← links)
• Coloring temporal graphs (Q2237899) (← links)
• Counting the number of solutions for instances of satisfiability (Q2277848) (← links)
• \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
• Enforcing efficient equilibria in network design games via subsidies (Q2345938) (← links)
• Combinatorial voter control in elections (Q2346381) (← links)
• Complexity analysis and algorithms for the program download problem (Q2354307) (← links)
• Solving Hamiltonian cycle by an EPT algorithm for a non-sparse parameter (Q2357164) (← links)
• On the complexity of the partner units decision problem (Q2407462) (← links)
• Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818) (← links)
• Boundary properties of the satisfiability problems (Q2450928) (← links)
• Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
• Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
• Satisfiability with index dependency (Q2637283) (← links)
• Deleting edges to restrict the size of an epidemic in temporal networks (Q2662670) (← links)
• Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
• On the generalized Helly property of hypergraphs, cliques, and bicliques (Q2689646) (← links)
• Can local optimality be used for efficient data reduction? (Q2692734) (← links)
• The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results (Q2827810) (← links)
• Distributed Evacuation in Graphs with Multiple Exits (Q2835028) (← links)
• On Variables with Few Occurrences in Conjunctive Normal Forms (Q3007672) (← links)
• On the Fine-Grained Complexity of Rainbow Coloring (Q3174728) (← links)
• A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
• Scheduling Bidirectional Traffic on a Path (Q3448803) (← links)
• A CNF Class Generalizing Exact Linear Formulas (Q3502711) (← links)
• Deciding Relaxed Two-Colourability: A Hardness Jump (Q3557504) (← links)
• Malicious Bayesian Congestion Games (Q3602834) (← links)
• The Lovász Local Lemma and Satisfiability (Q3644712) (← 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)