Pages that link to "Item:Q1254112"
From MaRDI portal
The following pages link to A linear-time algorithm for testing the truth of certain quantified Boolean formulas (Q1254112):
Displayed 50 items.
- Backdoors to q-Horn (Q261394) (← links)
- Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices (Q263094) (← links)
- Reconstruction of convex polyominoes with a blocking component (Q265062) (← links)
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies (Q286087) (← links)
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- Complexity versus stability for classes of propositional formulas (Q293437) (← links)
- Superpolynomial lower bounds for the \((1+1)\) EA on some easy combinatorial problems (Q306491) (← links)
- Red-blue clique partitions and \((1-1)\)-transversals (Q311567) (← links)
- Classical, quantum and nonsignalling resources in bipartite games (Q387029) (← links)
- On testing monomials in multivariate polynomials (Q391220) (← links)
- Reasoning about visibility (Q420853) (← links)
- The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph (Q450560) (← links)
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- The predecessor-existence problem for \(k\)-reversible processes (Q476889) (← links)
- An algorithmic toolbox for periodic partial words (Q477348) (← links)
- Path-driven orientation of mixed graphs (Q479025) (← links)
- Computing \(H\)-joins with application to 2-modular decomposition (Q486993) (← links)
- Parameterized complexity analysis for the closest string with wildcards problem (Q495996) (← links)
- Quell (Q500997) (← links)
- Rule set design problems for oritatami systems (Q529023) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- Quantified constraint satisfaction and the polynomially generated powers property (Q539977) (← links)
- Minimum sum of diameters clustering (Q581969) (← links)
- A randomized algorithm for 3-SAT (Q626900) (← links)
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances (Q633846) (← links)
- Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
- A logic-based approach to polymer sequence analysis (Q655183) (← links)
- Reconstructing convex polyominoes from horizontal and vertical projections (Q672143) (← links)
- An algorithm for finding homogeneous pairs (Q674438) (← links)
- Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation (Q714020) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- Rainbow graph splitting (Q719272) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- Efficient algorithms for network localization using cores of underlying graphs (Q742409) (← links)
- Algorithms for the maximum satisfiability problem (Q753502) (← links)
- The complexity of the satisfiability problem for Krom formulas (Q800915) (← links)
- Improving exact algorithms for MAX-2-SAT (Q812398) (← links)
- Incorporating bounds from decision diagrams into integer programming (Q823882) (← links)
- The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
- Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation (Q847824) (← links)
- Density condensation of Boolean formulas (Q860385) (← links)
- Algorithms solving the matching cut problem (Q897900) (← links)
- On the structure and the number of prime implicants of 2-\(\mathsf{CNF}\)s (Q906424) (← links)
- Existence of simple propositional formulas (Q917333) (← links)
- Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845) (← links)
- Solving peptide sequencing as satisfiability (Q929155) (← links)
- Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs (Q935835) (← links)