( en | de | ru )

 

Disambiguation of "Culberson, Joseph C."

Author of the publication

copydeleteadd this publication to your clipboard
Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story.

, and . Electron. Notes Discret. Math., (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Guido C C Clinckspoor

Thomas C C Knöbig

Ullrich C C Jagstaidt

Guido C C Clinckspoor

Thomas C C Gartenmann

 

Other publications of authors with the same name

Using Infeasibility to Improve Abstraction-Based Heuristics., , and . SARA, volume 4612 of Lecture Notes in Computer Science, page 413-414. Springer, (2007)DP-Complete Problems Derived from Extremal NP-Complete Properties., , and . MFCS, volume 5734 of Lecture Notes in Computer Science, page 199-210. Springer, (2009)On the Futility of Blind Search: An Algorithmic View of "No Free Lunch".. Evol. Comput., 6 (2): 109-127 (1998)A World Championship Caliber Checkers Program., , , , , and . Artif. Intell., 53 (2-3): 273-289 (1992)Phase Transitions of Dominating Clique Problem and Their Implications to Heuristics in Satisfiability Search., , and . IJCAI, page 78-83. Professional Book Center, (2005)Frozen development in graph coloring., and . Theor. Comput. Sci., 265 (1-2): 227-264 (2001)Orthogonally Convex Coverings of Orthogonal Polygons without Holes., and . J. Comput. Syst. Sci., 39 (2): 166-204 (1989)Cost-Driven Data Caching in the Cloud: An Algorithmic Approach., , , , , , and . INFOCOM, page 1-10. IEEE, (2021)Covering Polygons Is Hard (Preliminary Abstract), and . FOCS, page 601-611. IEEE Computer Society, (1988)A General Theory of Additive State Space Abstractions., , , , and . J. Artif. Intell. Res., (2008)