Search results for "hitting sets"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan	Weak Random Sources, Hitting Sets, and BPP Simulations.	FOCS	1997	DBLP DOI BibTeX RDF	BPP simulations, parallel classes, lower bound, sampling, polynomial time, randomised algorithms, hitting sets, weak random source, weak random sources, min-entropy
2	Pankaj K. Agarwal, Esther Ezra, Micha Sharir	Near-linear approximation algorithms for geometric hitting sets.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	geometric range spaces, shallow cuttings, union of simply-shaped regions, randomized algorithms, hitting sets
2	Nabil H. Mustafa, Saurabh Ray	PTAS for geometric hitting set problems via local search.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	approximation algorithm, local search, hitting sets, epsilon nets
2	Peter Damaschke	The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting.	STACS	2007	DBLP DOI BibTeX RDF	combinatorial inference, algorithms, parameterization, counting, hypergraph transversals
2	James Bailey, Peter J. Stuckey	Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization.	PADL	2005	DBLP DOI BibTeX RDF	Minimal unsatisfiable sets, constraint solving, hitting sets, hypergraph transversals
2	Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino	On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets.	STACS	2002	DBLP DOI BibTeX RDF	infrequent sets, Data mining, independent sets, hitting sets, transversals, frequent sets, dualization
2	Peter Bro Miltersen, N. V. Vinodchandran	Derandomizing Arthur-Merlin Games Using Hitting Sets.	FOCS	1999	DBLP DOI BibTeX RDF	derandomization, hitting sets, Arthur-Merlin games
2	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim	Efficient Construction of Hitting Sets for Systems of Linear Functions.	STACS	1997	DBLP DOI BibTeX RDF
2	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim	Hitting Sets Derandomize BPP.	ICALP	1996	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Esther Ezra, Micha Sharir	Near-Linear Approximation Algorithms for Geometric Hitting Sets.	Algorithmica	2012	DBLP DOI BibTeX RDF
1	Maurice J. Jansen, Rahul Santhanam	Marginal hitting sets imply super-polynomial lower bounds for permanent.	ITCS	2012	DBLP DOI BibTeX RDF
1	Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena	Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits.	STOC	2012	DBLP DOI BibTeX RDF
1	Maurice J. Jansen, Rahul Santhanam	Marginal Hitting Sets Imply Super-Polynomial Lower Bounds for Permanent.	Electronic Colloquium on Computational Complexity (ECCC)	2011	DBLP BibTeX RDF
1	Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena	Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits.	Electronic Colloquium on Computational Complexity (ECCC)	2011	DBLP BibTeX RDF
1	Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena	Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits	CoRR	2011	DBLP BibTeX RDF
1	Jirí Síma, Stanislav Zák	Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs.	CSR	2011	DBLP DOI BibTeX RDF
1	Eli Gafni, Petr Kuznetsov	Relating L\mathcal{L}-Resilience and Wait-Freedom via Hitting Sets.	ICDCN	2011	DBLP DOI BibTeX RDF
1	Guy Even, Shakhar Smorodinsky	Hitting Sets Online and Vertex Ranking.	ESA	2011	DBLP DOI BibTeX RDF
1	Wenquan Feng, Min Du, Qi Zhao, Dong Wang	A Method of Combining HSSE-tree and Binary Label to Compute All Minimal Hitting Sets.	ISCID	2011	DBLP DOI BibTeX RDF
1	Pascal Schweitzer, Patrick Schweitzer	Connecting face hitting sets in planar graphs.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
1	Eli Gafni, Petr Kuznetsov	L-Resilient Adversaries and Hitting Sets	CoRR	2010	DBLP BibTeX RDF
1	Blai Bonet, Malte Helmert	Strengthening Landmark Heuristics via Hitting Sets.	ECAI	2010	DBLP BibTeX RDF
1	Eli Gafni, Petr Kuznetsov	Brief announcement: on L-resilience, hitting sets, and colorless tasks.	PODC	2010	DBLP DOI BibTeX RDF	distributed tasks, l-resilience, weak solvability, wait-freedom
1	Peter Damaschke	Multiple hypernode hitting sets and smallest two-cores with targets.	J. Comb. Optim.	2009	DBLP DOI BibTeX RDF
1	Peter Damaschke, Leonid Molokov	The union of minimal hitting sets: Parameterized combinatorial bounds and counting.	J. Discrete Algorithms	2009	DBLP DOI BibTeX RDF
1	Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf	Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs.	ESA	2009	DBLP DOI BibTeX RDF
1	Sören Laue	Geometric Set Cover and Hitting Sets for Polytopes in $R^3$	CoRR	2008	DBLP BibTeX RDF
1	Markus Bläser, Moritz Hardt, David Steurer	Asymptotically Optimal Hitting Sets Against Polynomials.	ICALP	2008	DBLP DOI BibTeX RDF
1	Sören Laue	Geometric Set Cover and Hitting Sets for Polytopes in R3.	STACS	2008	DBLP DOI BibTeX RDF
1	Peter Damaschke	Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets.	COCOA	2008	DBLP DOI BibTeX RDF
1	Evangelia Pyrga, Saurabh Ray	New existence proofs epsilon-nets.	Symposium on Computational Geometry	2008	DBLP DOI BibTeX RDF	strong ?-nets, discrete geometry, hitting sets, hypergraph transversals
1	Ken Takata	A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph.	SIAM J. Discrete Math.	2007	DBLP DOI BibTeX RDF
1	Xiangfu Zhao, Dantong Ouyang	Improved Algorithms for Deriving All Minimal Conflict Sets in Model-Based Diagnosis.	ICIC	2007	DBLP DOI BibTeX RDF	conflict set, set enumeration tree (SE-tree), model-based diagnosis, hitting set
1	Jirí Síma, Stanislav Zák	A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3.	SOFSEM	2007	DBLP DOI BibTeX RDF
1	Dietmar Jannach, Johannes Liegl	Conflict-Directed Relaxation of Constraints in Content-Based Recommender Systems.	IEA/AIE	2006	DBLP DOI BibTeX RDF
1	Guy Even, Dror Rawitz, Shimon Shahar	Hitting sets when the VC-dimension is small.	Inf. Process. Lett.	2005	DBLP DOI BibTeX RDF
1	Peter Bro Miltersen, N. V. Vinodchandran	Derandomizing Arthur-Merlin Games using Hitting Sets.	Computational Complexity	2005	DBLP DOI BibTeX RDF	68Q17, Subject classification. 68Q15
1	Dogan Kesdogan, Lexi Pimenidis	The Hitting Set Attack on Anonymity Protocols.	Information Hiding	2004	DBLP DOI BibTeX RDF
1	Li Lin, Yunfei Jiang	The computation of hitting sets: Review and new algorithms.	Inf. Process. Lett.	2003	DBLP DOI BibTeX RDF
1	Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan	An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals.	ESA	2003	DBLP DOI BibTeX RDF
1	Vilhelm Dahllöf, Peter Jonsson	An algorithm for counting maximum weighted independent sets and its applications.	SODA	2002	DBLP DOI BibTeX RDF
1	Staal A. Vinterbo, Aleksander Øhrn	Minimal approximate hitting sets and rule templates.	Int. J. Approx. Reasoning	2000	DBLP DOI BibTeX RDF
1	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan	Weak Random Sources, Hitting Sets, and BPP Simulations.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
1	L. Sunil Chandran	A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles.	FSTTCS	1999	DBLP DOI BibTeX RDF
1	Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim	Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs.	ICALP	1999	DBLP DOI BibTeX RDF
1	Dimitris J. Kavvadias, Elias C. Stavropoulos	Evaluation of an Algorithm for the Transversal Hypergraph Problem.	Algorithm Engineering	1999	DBLP DOI BibTeX RDF
1	Dimitris Fotakis, Paul G. Spirakis	Random Walks, Conditional Hitting Sets and Partial Derandomization	Electronic Colloquium on Computational Complexity (ECCC)	1998	DBLP BibTeX RDF
1	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan	Weak Random Sources, Hitting Sets, and BPP Simulations	Electronic Colloquium on Computational Complexity (ECCC)	1997	DBLP BibTeX RDF
1	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim	Towards efficient constructions of hitting sets that derandomize BPP	Electronic Colloquium on Computational Complexity (ECCC)	1996	DBLP BibTeX RDF
1	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim	Hitting Sets Derandomize BPP	Electronic Colloquium on Computational Complexity (ECCC)	1995	DBLP BibTeX RDF