371 search results - page 19 / 75 » Partition Theorems and Computability Theory |
ICTAC
2005
Springer
15 years 3 months ago
2005
Springer
n abstract computer virology G. Bonfante, M. Kaczmarek, and J-Y Marion Loria, Calligramme project, B.P. 239, 54506 Vandœuvre-l`es-Nancy C´edex, France, and ´Ecole Nationale Sup...
DAC
1994
ACM
15 years 1 months ago
1994
ACM
Acyclic partitioning on combinational boolean networks has wide range of applications, from multiple FPGA chip partitioning to parallel circuit simulation. In this paper, we prese...
117
Voted
DCC
2005
IEEE
15 years 9 months ago
2005
IEEE
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
TLCA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...