K. Mulmuley, U.V. Vazirani, and V.V. Vazirani. Matching is as easy as matrix inversion. Combinatorica, 7(1):105--114, 1987. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
RNC-Approximation Algorithms for the Steiner Problem - Prömel, Steger (1997) (1 citation) (Correct)
Boolean Complexity Classes Vs. Their Arithmetic - Analogs Anna Al (Correct)
A New Rounding Procedure for the Assignment Problem with.. - Arora, Frieze, Kaplan (2001) (36 citations) (Correct)
The Monotone Theory for the PAC-Model - Bshouty (Correct)
NP Might Not Be As Easy As Detecting Unique Solutions - Beigel, Buhrman, Fortnow (1997) (4 citations) (Correct)
Communication Complexity of Key Agreement on Small Ranges - Cai, Lipton.. (Correct)
Algorithmic Derandomization via Complexity Theory - Sivakumar (2002) (2 citations) (Correct)
Parallel Algorithms in Graph Theory and Algebra - Holloway (Correct)
Bounded Length UCFG Equivalence - Litow (1996) (Correct)
Parallel Algorithmic Techniques for Combinatorial Computation - Eppstein, Galil (1988) (26 citations) (Correct)
On the Hardness of Graph Isomorphism - Torán (2000) (6 citations) (Correct)
Randomness Efficient Identity Testing of Multivariate.. - Klivans, Spielman (Correct)
Parallel Output Sensitive Algorithms for Combinatorial and Linear.. - Reif (2000) (Correct)
Approximation and Compression for the Verification of.. - Richard Lassaigne And (Correct)
Randomized ... Algorithms for Problems in Matching Theory - Cheriyan (1997) (Correct)
A Compendium of Problems Complete for P - Greenlaw, Hoover, Ruzzo (1991) (14 citations) (Correct)
Reducing Randomness In Computation Via Explicit Constructions - Zhou (1996) (Correct)
The Structural Complexity Column - By Juris Hartmanis (Correct)
An NC Algorithm For Minimum Cuts - Karger, Motwani (1997) (4 citations) (Correct)
Threshold functions for H-factors - Alon, Yuster (1993) (5 citations) (Correct)
On Parallel Complexity of Maximum F-Matching and the.. - Dessmark, Garrido.. (1994) (1 citation) (Correct)
A Combinatorial Algorithm for Pfaffians - Mahajan, Subramanya, Vinay (1999) (Correct)
Sublinear-Time Parallel Algorithms for Matching and Related .. - Goldberg, Plotkin, M. (1993) (17 citations) (Correct)
On the parallel complexity of Hamiltonian Cycle and.. - Dahlhaus, Hajnal.. (1993) (1 citation) (Correct)
Quasi-Fully Dynamic Algorithms for Two-Connectivity.. - Korupolu, Ramachandran (1997) (Correct)
An Algebraic Matching Algorithm - Geelen (1997) (1 citation) (Correct)
A new NC-algorithm for finding a perfect matching in bipartite .. - Mahajan, al. (2000) (Correct)
Interior Point Methods in Semidefinite Programming with.. - Alizadeh (1993) (223 citations) (Correct)
Selected Topics on Assignment Problems - Burkard (1999) (1 citation) (Correct)
The Complexity of Tensor Calculus - Damm, Holzer, McKenzie (2000) (1 citation) (Correct)
Communication Complexity of Key Agreement on Small Ranges - Cai, Lipton.. (Correct)
Finding Largest Subtrees and Smallest Supertrees - Gupta, Nishimura (1998) (7 citations) (Correct)
Combinatorial Methods In Boolean Function Complexity - Gal (1995) (5 citations) (Correct)
An Approximation Algorithm for the Bandwidth Problem.. - Karpinski, Wirtgen.. (1997) (2 citations) (Correct)
Representing all Minimum Spanning Trees with Applications to.. - Eppstein (1995) (1 citation) (Correct)
Randomized Algorithms Georgia Tech CS8113F, Winter 1999.. - Scribe Germ'an Ria (Correct)
Unknown - Decision Making Based (2005) (Correct)
Primality and Identity Testing via Chinese Remaindering - Agrawal, Biswas (2003) (1 citation) (Correct)
Optimally Cutting a Surface into a Disk - Erickson, Har-Peled (2002) (7 citations) (Correct)
List Edge Multicoloring in Bounded Cyclicity Graphs - Marx (2003) (Correct)
Making Nondeterminism Unambiguous - Reinhardt, Allender (1997) (5 citations) (Correct)
Making Nondeterministic Computations - Unambiguous In Partial (1998) (Correct)
Max Algebra and the Linear Assignment Problem - Burkard, Butkovic (2003) (Correct)
Fast and Efficient Parallel Solution of Dense Linear Systems - Pan, Reif (1989) (2 citations) (Correct)
Graph-Theoretic Techniques in D-Optimal Design Problems - Chatterjee, Narasimhan (2001) (Correct)
Strongly Connected Spanning Subgraphs With the Minimum.. - Bang-Jensen, Yeo (2000) (Correct)
A New Parallel Algorithm For The Maximal Independent Set Problem - Goldberg, Spencer (1989) (31 citations) (Correct)
Reductions, Codes, PCPs, and Inapproximability - Arora (1995) (1 citation) (Correct)
Lower Bounds For Parallel Algorithms - Shah (2001) Self-citation (Mulmuley) (Correct)
A Lower Bound for the Shortest Path Problem - Mulmuley Self-citation (Mulmuley) (Correct)
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC