Sciweavers

2 search results - page 1 / 1
» cjtcs 2000
Sort
View
32
Voted
CJTCS
2000
35views more  CJTCS 2000»
14 years 10 months ago
Heuristics Versus Completeness for Graph Coloring
Jörg Rothe
79
Voted
CJTCS
1999
133views more  CJTCS 1999»
14 years 10 months ago
The Permanent Requires Large Uniform Threshold Circuits
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
Eric Allender