Suchergebnisse - "deterministic NC algorithm"

Factoring Rational Polynomials over the Complex Numbers: Factoring rational polynomials over the complex numbers

Autoren: John Canny Joe Warren Chanderjit Bajaj et al.

Quelle: SIAM Journal on Computing. 22:318-331

Schlagwörter: multivariate polynomial, Analysis of algorithms and problem complexity, deterministic NC algorithm, squarefree polynomial in two variables, Polynomials in real and complex fields: factorization, Computational aspects of field theory and polynomials, 0102 computer and information sciences, 0101 mathematics, algorithms, 01 natural sciences, irreducible factors

Dateibeschreibung: application/xml

Zugangs-URL: http://www.cs.rice.edu/~jwarren/papers/SJC.factor.pdf
https://zbmath.org/165028
https://doi.org/10.1137/0222024
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp22.html#BajajCGW93
https://doi.org/10.1137/0222024
https://epubs.siam.org/doi/abs/10.1137/0222024
https://dl.acm.org/doi/abs/10.1137/0222024
https://locus.siam.org/doi/abs/10.1137/0222024

Constructing a Maximal Independent Set in Parallel: Constructing a maximal independent set in parallel

Autoren: Thomas H. Spencer Mark Goldberg

Quelle: SIAM Journal on Discrete Mathematics. 2:322-328

Schlagwörter: EREW PRAM model, Graph theory (including graph drawing) in computer science, deterministic NC-algorithm, 0102 computer and information sciences, Models of computation (Turing machines, etc.), maximal independent set, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://epubs.siam.org/doi/abs/10.1137/0402028
http://www.cs.rpi.edu/~goldberg/publications/ind-1.pdf
https://dblp.uni-trier.de/db/journals/siamdm/siamdm2.html#GoldbergS89
http://core.ac.uk/display/22939540
https://locus.siam.org/doi/abs/10.1137/0402028