Sciweavers

2432 search results - page 51 / 487
» Degrees and choice numbers
Sort
View
JGT
2007
87views more  JGT 2007»
15 years 1 months ago
A new upper bound on the cyclic chromatic number
A cyclic colouring of a plane graph is a vertex colouring such that vertices incident with the same face have distinct colours. The minimum number of colours in a cyclic colouring...
Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, ...
DAM
2007
153views more  DAM 2007»
15 years 1 months ago
Computing the minimum number of hybridization events for a consistent evolutionary history
It is now well-documented that the structure of evolutionary relationships between a set of present-day species is not necessarily tree-like. The reason for this is that reticulat...
Magnus Bordewich, Charles Semple
CORR
2011
Springer
146views Education» more  CORR 2011»
14 years 9 months ago
Refined bounds on the number of connected components of sign conditions on a variety
Let R be a real closed field, P, Q ⊂ R[X1, . . . , Xk] finite subsets of polynomials, with the degrees of the polynomials in P (resp. Q) bounded by d (resp. d0). Let V ⊂ Rk b...
Sal Barone, Saugata Basu
CHES
2011
Springer
276views Cryptology» more  CHES 2011»
14 years 1 months ago
FPGA-Based True Random Number Generation Using Circuit Metastability with Adaptive Feedback Control
Abstract. The paper presents a novel and efficient method to generate true random numbers on FPGAs by inducing metastability in bi-stable circuit elements, e.g. flip-flops. Meta...
Mehrdad Majzoobi, Farinaz Koushanfar, Srinivas Dev...
ANTS
2010
Springer
263views Algorithms» more  ANTS 2010»
15 years 5 months ago
Computing Automorphic Forms on Shimura Curves over Fields with Arbitrary Class Number
We extend methods of Greenberg and the author to compute in the cohomology of a Shimura curve defined over a totally real field with arbitrary class number. Via the Jacquet-Langlan...
John Voight