Pages that link to "Item:Q790612"
From MaRDI portal
The following pages link to A simplified NP-complete satisfiability problem (Q790612):
Displaying 50 items.
- Strong cliques and equistability of EPT graphs (Q260014) (← links)
- A simplified NP-complete MAXSAT problem (Q293164) (← links)
- Computing an evolutionary ordering is hard (Q324805) (← links)
- It is difficult to tell if there is a Condorcet spanning tree (Q328521) (← links)
- Disproof of the neighborhood conjecture with implications to SAT (Q377802) (← links)
- Parameterized complexity of MaxSat above average (Q392026) (← links)
- On the maximum disjoint paths problem on edge-colored graphs (Q435732) (← links)
- The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT (Q456705) (← links)
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
- Path-driven orientation of mixed graphs (Q479025) (← links)
- Finding disjoint paths in split graphs (Q493652) (← links)
- The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles (Q497683) (← links)
- Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← links)
- About some UP-based polynomial fragments of SAT (Q513329) (← links)
- Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable (Q557836) (← links)
- Topological implications of selfish neighbor selection in unstructured peer-to-peer networks (Q639277) (← links)
- The minimum broadcast time problem for several processor networks (Q672455) (← links)
- Rainbow graph splitting (Q719272) (← links)
- Clustering with lower-bounded sizes. A general graph-theoretic framework (Q722539) (← links)
- Algorithms for the maximum satisfiability problem (Q753502) (← links)
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- Balanced independent and dominating sets on colored interval graphs (Q831789) (← links)
- Computational complexity of some restricted instances of 3-SAT (Q875598) (← links)
- Tensor network contractions for \#SAT (Q887094) (← links)
- On the complexity of role colouring planar graphs, trees and cographs (Q891815) (← links)
- Further hardness results on rainbow and strong rainbow connectivity (Q908308) (← links)
- Errata for the paper ``Predecessor existence problems for finite discrete dynamical systems''. (Q924687) (← links)
- Approximately fair cost allocation in metric traveling salesman games (Q927408) (← links)
- Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT (Q1028148) (← links)
- Linear CNF formulas and satisfiability (Q1028433) (← links)
- Scheduling tasks on two processors with deadlines and additional resources (Q1084012) (← links)
- Local optimization on graphs (Q1122503) (← links)
- The \(k\)-SATISFIABILITY problem remains NP-complete for dense families (Q1322290) (← links)
- Algorithmic complexity of list colorings (Q1327214) (← links)
- A special planar satisfiability problem and a consequence of its NP- completeness (Q1331895) (← links)
- Recognition of \(q\)-Horn formulae in linear time (Q1337669) (← links)
- DNF tautologies with a limited number of occurrences of every variable (Q1575269) (← links)
- The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degree (Q1627866) (← links)
- On the optimality of exact and approximation algorithms for scheduling problems (Q1635503) (← links)
- On the parameterized complexity of \((k,s)\)-SAT (Q1711421) (← links)
- On the planar split thickness of graphs (Q1742373) (← links)
- Domination problems with no conflicts (Q1752590) (← links)
- Operads of finite posets (Q1753009) (← links)
- On the minimum size of an identifying code over all orientations of a graph (Q1753015) (← links)
- Complexity of Gröbner basis detection and border basis detection (Q1758159) (← links)
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
- Solving the resolution-free SAT problem by submodel propagation in linear time (Q1777398) (← links)
- Generalizations of matched CNF formulas (Q1777405) (← links)
- An improved lower bound for rank four scheduling (Q1785250) (← links)
- Selecting and covering colored points (Q1801049) (← links)
