Add to ORKGSIGLETIB: RN 2394 (888) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
A list of some notation G denotes a graph. X ⊆ Y X is a subset of Y. X ⊂ Y X is a proper subset of Y...
CNRS RS 17660 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueSIGLEFRFranc
We present an algorithm that determines the prime factors of connected graphs with respect to the Ca...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
We present a polynomial-time algorithm for deciding whether a given connected graph is a non-trivial...
Looks at how linear factors to odd and even powers can help in sketching polynomial functions that c...
SIGLECNRS 14802 E / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
A factor graph is a representation of a factorization of a function. The importance of factor graphs...
An algorithm for the factorization of an arbitrary graph G is given. We present an algorithm in pseu...
By a result of McKenzie [7] all finite directed graphs that satisfy certain connectivity conditions ...
National audienceWe describe a simple procedure to find Aurifeuillian factors of values of cyclotomi...
SIGLETIB: RO 1829 (1984,15) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
AbstractLet the connected graph G be canonically embedded into a Cartesian product ∏i∈lG∗i. We impro...
Theme 2 - Genie logiciel et calcul symbolique. Projet AlgoSIGLEAvailable from INIST (FR), Document S...
On 22 May 2000, the factorization of a pseudorandom polynomial of degree 1 048 543 over the binary f...
A list of some notation G denotes a graph. X ⊆ Y X is a subset of Y. X ⊂ Y X is a proper subset of Y...
CNRS RS 17660 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueSIGLEFRFranc
We present an algorithm that determines the prime factors of connected graphs with respect to the Ca...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
We present a polynomial-time algorithm for deciding whether a given connected graph is a non-trivial...
Looks at how linear factors to odd and even powers can help in sketching polynomial functions that c...
SIGLECNRS 14802 E / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
A factor graph is a representation of a factorization of a function. The importance of factor graphs...
An algorithm for the factorization of an arbitrary graph G is given. We present an algorithm in pseu...
By a result of McKenzie [7] all finite directed graphs that satisfy certain connectivity conditions ...
National audienceWe describe a simple procedure to find Aurifeuillian factors of values of cyclotomi...
SIGLETIB: RO 1829 (1984,15) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
AbstractLet the connected graph G be canonically embedded into a Cartesian product ∏i∈lG∗i. We impro...
Theme 2 - Genie logiciel et calcul symbolique. Projet AlgoSIGLEAvailable from INIST (FR), Document S...
On 22 May 2000, the factorization of a pseudorandom polynomial of degree 1 048 543 over the binary f...
A list of some notation G denotes a graph. X ⊆ Y X is a subset of Y. X ⊂ Y X is a proper subset of Y...
CNRS RS 17660 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueSIGLEFRFranc
We present an algorithm that determines the prime factors of connected graphs with respect to the Ca...