Pages that link to "Item:Q958212"
From MaRDI portal
The following pages link to Exact algorithms for exact satisfiability and number of perfect matchings (Q958212):
Displaying 24 items.
- Exponential approximation schemata for some network design problems (Q396669) (← links)
- Solving the train marshalling problem by inclusion-exclusion (Q516904) (← links)
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736) (← links)
- Trimmed Moebius inversion and graphs of bounded degree (Q1959390) (← links)
- Improved algorithms for the general exact satisfiability problem (Q2232607) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Faster exponential-time algorithms in graphs of bounded average degree (Q2347799) (← links)
- Partition into triangles on bounded degree graphs (Q2392247) (← links)
- Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
- Invitation to Algorithmic Uses of Inclusion–Exclusion (Q3012908) (← links)
- Exact covers via determinants (Q3113740) (← links)
- Partitioning into Sets of Bounded Cardinality (Q3656867) (← links)
- From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces (Q4994986) (← links)
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank (Q5009610) (← links)
- More Efficient Match-Making and Satisfiability The Five Card Trick (Q5110898) (← links)
- Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration (Q5119842) (← links)
- APPROXIMATING ASYMMETRIC TSP IN EXPONENTIAL TIME (Q5168426) (← links)
- Exact Algorithms via Monotone Local Search (Q5244381) (← links)
- (Q5743447) (← links)
- When polynomial approximation meets exact computation (Q5892165) (← links)
- When polynomial approximation meets exact computation (Q5915964) (← links)
- Faster graph coloring in polynomial space (Q5925619) (← links)
- Exponential-time quantum algorithms for graph coloring problems (Q5970782) (← links)