612 search results - page 19 / 123 » Hardness assumptions in the foundations of theoretical compu... |
FOCS
2002
IEEE
14 years 20 days ago
2002
IEEE
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...
RELMICS
2001
Springer
14 years 4 days ago
2001
Springer
Groups are one of the most fundamental notions in mathematics. This paper provides a foundation of group theory in allegories. Almost all results in the paper can be applied to the...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
Taha and Nielsen have developed a multi-stage calculus λα with a sound type system using the notion of environment classifiers. They are special identifiers, with which code fr...
WG
2005
Springer
14 years 1 months ago
2005
Springer
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. Th...