Pages that link to "Item:Q1095658"

The following pages link to Matching is as easy as matrix inversion (Q1095658):

Displaying 50 items.

• Random pseudo-polynomial algorithms for some combinatorial programming problems (Q1194734) (← links)
• Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
• Tight complexity bounds for term matching problems (Q1201724) (← links)
• Approximating matchings in parallel (Q1261482) (← links)
• Improved processor bounds for combinatorial problems in RNC (Q1262128) (← links)
• Constructing disjoint paths on expander graphs (Q1262782) (← links)
• Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones (Q1285764) (← links)
• Parallel algorithms for the assignment and minimum-cost flow problems (Q1319670) (← links)
• The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
• Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity (Q1343167) (← links)
• (De)randomized construction of small sample spaces in \(\mathcal{NC}\) (Q1384529) (← links)
• Maximum vertex-weighted matching in strongly chordal graphs (Q1392564) (← links)
• Matching and multidimensional matching in chordal and strongly chordal graphs (Q1392565) (← links)
• The monotone theory for the PAC-model. (Q1426003) (← links)
• Randomized algorithms over finite fields for the exact parity base problem. (Q1578505) (← links)
• Graph-theoretic techniques in D-optimal design problems (Q1598699) (← links)
• Optimization problems with color-induced budget constraints (Q1631646) (← links)
• Computing girth and cogirth in perturbed graphic matroids (Q1747998) (← links)
• A random polynomial time algorithm for well-routing convex bodies (Q1805452) (← links)
• Fast and efficient parallel solution of dense linear systems (Q1825589) (← links)
• The combinatorial approach yields an NC algorithm for computing Pfaffians (Q1887034) (← links)
• Random parallel algorithms for finding exact branchings, perfect matchings, and cycles (Q1891230) (← links)
• Designing checkers for programs that run in parallel (Q1911462) (← links)
• Deterministically isolating a perfect matching in bipartite planar graphs (Q1959397) (← links)
• Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
• A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy (Q2011643) (← links)
• Linear matroid intersection is in quasi-NC (Q2027206) (← links)
• A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks (Q2029899) (← links)
• Blackbox identity testing for sum of special ROABPs and its border class (Q2041244) (← links)
• An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem (Q2076286) (← links)
• Matching numbers in fuzzy graphs (Q2143824) (← links)
• Maximum 0-1 timed matching on temporal graphs (Q2161255) (← links)
• Tropical combinatorial Nullstellensatz and sparse polynomials (Q2194772) (← links)
• The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
• Improved distance sensitivity oracles with subcubic preprocessing time (Q2237898) (← links)
• Computing Walrasian equilibria: fast algorithms and structural properties (Q2288196) (← links)
• Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
• On the maximum weight minimal separator (Q2333804) (← links)
• Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
• Equivalence of polynomial identity testing and polynomial factorization (Q2351391) (← links)
• A fast parallel algorithm for minimum-cost small integral flows (Q2354029) (← links)
• Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs (Q2365177) (← links)
• Decision-making based on approximate and smoothed Pareto curves (Q2371803) (← links)
• A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219) (← links)
• Integrality gaps for colorful matchings (Q2419586) (← links)
• Almost exact matchings (Q2429356) (← links)
• Bisimplicial edges in bipartite graphs (Q2446296) (← links)
• A polynomial time equivalence between DNA sequencing and the exact perfect matching problem (Q2467125) (← links)
• Improved approximation algorithms for metric MaxTSP (Q2467566) (← links)
• Processor efficient parallel matching (Q2471700) (← links)