Search results for "hard/easy"

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

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
42	Steffen Reith, Klaus W. Wagner	On Boolean Lowness and Boolean Highness.	COCOON	1998	DBLP DOI BibTeX RDF	lowness, highness, boolean lowness, boolean highness, boolean hierarchy, hard/easy, Computational complexity, advice, polynomial-time hierarchy, collapse
41	Andrew J. Parkes	Easy Predictions for the Easy-Hard-Easy Transition.	AAAI/IAAI	2002	DBLP BibTeX RDF
30	Dorothy L. Mammen, Tad Hogg	A New Look at the Easy-Hard-Easy Pattern of Combinatorial Search Difficulty.	J. Artif. Intell. Res.	1997	DBLP DOI BibTeX RDF
30	Dorothy L. Mammen, Tad Hogg	A New Look at the Easy-Hard-Easy Pattern of Combinatorial Search Difficulty	CoRR	1997	DBLP BibTeX RDF
20	Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabharwal, Jordan Suter	Connections in Networks: Hardness of Feasibility Versus Optimality.	CPAIOR	2007	DBLP DOI BibTeX RDF
17	H. Van Dyke Parunak, Sven Brueckner, John A. Sauter, Robert Savit	Effort profiles in multi-agent resource allocation.	AAMAS	2002	DBLP DOI BibTeX RDF	effort profile, complexity, resource allocation, negotiation, phase transition, phase change
17	Weixiong Zhang	Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT.	CP	2001	DBLP DOI BibTeX RDF
14	Gayathri Namasivayam	Study of Random Logic Programs.	ICLP	2009	DBLP DOI BibTeX RDF
14	Gayathri Namasivayam, Miroslaw Truszczynski	Simple Random Logic Programs.	LPNMR	2009	DBLP DOI BibTeX RDF
11	Calin Anton, Lane Olson	Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism.	Canadian AI	2009	DBLP DOI BibTeX RDF
11	Lucian Leahu, Carla P. Gomes	LP as a Global Search Heuristic Across Different Constrainedness Regions.	CP	2005	DBLP DOI BibTeX RDF
11	Tassos Dimitriou	A Wealth of SAT Distributions with Planted Assignments.	CP	2003	DBLP DOI BibTeX RDF
9	Rhyd Lewis	Metaheuristics can solve sudoku puzzles.	J. Heuristics	2007	DBLP DOI BibTeX RDF	Metaheuristics, Phase-transition, Puzzles, Sudoku
9	Jano I. van Hemert, Neil Urquhart	Phase Transition Properties of Clustered Travelling Salesman Problem Instances Generated with Evolutionary Computation.	PPSN	2004	DBLP DOI BibTeX RDF
6	Olaf Beyersdorff, Sebastian Müller 0003	A Tight Karp-Lipton Collapse Result in Bounded Arithmetic.	CSL	2008	DBLP DOI BibTeX RDF	Karp-Lipton Theorem, Optimal Propositional Proof Systems, Extended Frege, Bounded Arithmetic, Advice