Search results for "polynomial time randomized algorithms"

Searching for phrase polynomial time randomized algorithms (changed automatically) with no syntactic query expansion in all metadata.

Found 4 publication records. Showing 4 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Petros Drineas, Michael W. Mahoney, S. Muthukrishnan	Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
1	Tomoyuki Yamakami	Nearly Bounded Error Probabilistic Sets.	CIAC	2003	DBLP DOI BibTeX RDF
1	Hong Shen	Finding the k Most Vital Edges with Respect to Minimum Spanning Tree.	Acta Inf.	1999	DBLP DOI BibTeX RDF
1	Sanjeev Mahajan, Ramesh Hariharan	Derandomizing Semidefinite Programming Based Approximation Algorithms.	FOCS	1995	DBLP DOI BibTeX RDF	semidefinite programming based approximation algorithms, Max k-Cut, Max-Dicut, Max-Bisection, k Vertex Coloring, polynomial time randomized algorithms, polynomial time deterministic algorithms, computational complexity, randomized algorithms, semidefinite programming, programming theory, NP-Complete problems, deterministic algorithms, Independent Set, randomised algorithms, Max-Cut, Max-Sat

Displaying result #1 - #4 of 4 (100 per page; Change: )

Maintained by Jörg Diederich.

Based upon DBLP by Michael Ley.