35 search results - page 6 / 7 » Proof of a Chromatic Polynomial Conjecture |
STOC
2003
ACM
14 years 6 months ago
2003
ACM
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
CHARME
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. As of version 2.7, the ACL2 theorem prover has been extended to automatically verify sets of polynomial inequalities that include nonlinear relationships. In this paper w...
JC
2008
13 years 5 months ago
2008
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
JCT
2011
13 years 21 days ago
2011
We give combinatorial proofs of the formulas for the number of multichains in the k-divisible noncrossing partitions of classical types with certain conditions on the rank and the ...
SIAMCOMP
2000
13 years 5 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...