|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2667 occurrences of 1351 keywords
|
|
|
Results
Found 9920 publication records. Showing 9920 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
33 | Johann A. Makowsky |
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings, pp. 330-341, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Philippe Pitteloud |
Chromatic Polynomials and the Symmetric Group. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(1), pp. 131-144, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vincent Loechner, Maurice Bruynooghe |
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASES ![In: Proceedings of the 2004 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES 2004, Washington DC, USA, September 22 - 25, 2004, pp. 248-258, 2004, ACM, 1-58113-890-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Barvinok's decomposition, Ehrhart polynomial, parametric polytope, quasi-polynomial, signed unimodular decomposition, polyhedral model, compiler analysis |
33 | Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton |
Polynomials That Sign Represent Parity and Descartes Rule of Signs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA, pp. 223-235, 2004, IEEE Computer Society, 0-7695-2120-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Eric Allender, Anna Bernasconi 0001, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor E. Shparlinski |
Complexity of some arithmetic problems for binary polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 12(1-2), pp. 23-47, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). ((no classification)) |
33 | Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton |
Symmetric Polynomials over Zm and Simultaneous Communication Protocol. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 450-459, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Erich L. Kaltofen, John P. May |
On approximate irreducibility of polynomials in several variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2003, Drexel University, Philadelphia, Pennsylvania, USA, August 3-6, 2003, Proceedings, pp. 161-168, 2003, ACM, 1-58113-641-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
absolute irreducibility, effective Noether irreducibility forms, multivariate polynomial factorization, radius of irreducibility, approximate factorization, symbolic/numeric hybrid method |
33 | Subhamoy Maitra, Kishan Chand Gupta, Ayineedi Venkateswarlu |
Multiples of Primitive Polynomials and Their Products over GF(2). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Selected Areas in Cryptography ![In: Selected Areas in Cryptography, 9th Annual International Workshop, SAC 2002, St. John's, Newfoundland, Canada, August 15-16, 2002. Revised Papers, pp. 214-231, 2002, Springer, 3-540-00622-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | Yuval Ishai, Eyal Kushilevitz |
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 244-256, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | |
The COPRIN Project: Minimal and Maximal Real Roots of Parametric Polynomials Using Interval Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOS ![In: Global Optimization and Constraint Satisfaction, First International Workshop Global Constraint Optimization and Constraint Satisfaction, COCOS 2002, Valbonne-Sophia Antipolis, France, October 2-4, 2002, Revised Selected Papers, pp. 71-86, 2002, Springer, 3-540-20463-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
parametric polynomial, eigenvalues, interval analysis |
33 | Yang Xiao |
Hurwitz-Schur stability test of interval bivariate polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (2) ![In: Proceedings of the 2001 International Symposium on Circuits and Systems, ISCAS 2001, Sydney, Australia, May 6-9, 2001, pp. 829-832, 2001, IEEE, 0-7803-6685-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
33 | Kazumi Saito, Ryohei Nakano |
Discovery of Nominally Conditioned Polynomials Using Neural Networks, Vector Quantizers and Decision Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discovery Science ![In: Discovery Science, Third International Conference, DS 2000, Kyoto, Japan, December 4-6, 2000, Proceedings, pp. 325-329, 2000, Springer, 3-540-41352-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
33 | Neli S. Dimitrova, Svetoslav M. Markov |
Verified Computation of Fast Decreasing Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reliab. Comput. ![In: Reliab. Comput. 5(3), pp. 229-240, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
33 | Yang Xiao, Rolf Unbehauen, Xiyu Du |
A finite test algorithm for 2D Schur polynomials based on complex Lyapunov equation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (3) ![In: Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30 - June 2, 1999, pp. 339-342, 1999, IEEE, 0-7803-5471-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
33 | Yang Xiao, Rolf Unbehauen, Xiyu Du |
A necessary condition for Schur stability of 2D polynomials [digital filters]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (3) ![In: Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30 - June 2, 1999, pp. 439-442, 1999, IEEE, 0-7803-5471-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
33 | Jacques-Arthur Weil |
First Integrals and Darboux Polynomials of Homogeneous Linear Differential Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 11th International Symposium, AAECC-11, Paris, France, July 17-22, 1995, Proceedings, pp. 469-484, 1995, Springer, 3-540-60114-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
33 | Lothar Reichel |
Construction of polynomials that are orthogonal with respect to a discrete bilinear form. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 1(2), pp. 241-258, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
Subject classification AMS 65D10, 65F15, 65D15 |
33 | Tore Herlestam |
On Using Prime Polynomials in Crypto Generators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Cryptography, Proceedings of the Workshop on Cryptography, Burg Feuerstein, Germany, March 29 - April 2, 1982, pp. 207-216, 1982, Springer. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
33 | Tzay Y. Young |
Binomial-Weighted Orthogonal Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 14(1), pp. 120-127, 1967. The full citation details ...](Pics/full.jpeg) |
1967 |
DBLP DOI BibTeX RDF |
|
32 | Mehdi Parviz, Mohammad Shahram Moin |
Multivariate Polynomials Estimation Based on GradientBoost in Multimodal Biometrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (3) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Contemporary Intelligent Computing Techniques, 4th International Conference on Intelligent Computing, ICIC 2008, Shanghai, China, September 15-18, 2008, Proceedings, pp. 471-477, 2008, Springer, 978-3-540-85929-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
GradientBoost, Multivariate Polynomials, Classifiers Fusion, Multimodal Biometrics |
32 | Marco Bodrato |
Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAIFI ![In: Arithmetic of Finite Fields, First International Workshop, WAIFI 2007, Madrid, Spain, June 21-22, 2007, Proceedings, pp. 116-133, 2007, Springer, 978-3-540-73073-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Toom-Cook, Karatsuba, GF2x, binary polynomials, finite fields, convolution, multivariate, squaring, Polynomial multiplication |
32 | Leonid Gurvits |
Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures: sharper bounds, simpler proofs and algorithmic applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 417-426, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
hyperbolic polynomials, graph, convex optimization, permanent |
32 | Igor E. Shparlinski, Arne Winterhof |
Noisy interpolation of sparse polynomials in finite fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 16(5), pp. 307-317, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Noisy interpolation, Finite fields, Lattice reduction, Exponential sums, Sparse polynomials, Hidden number problem |
32 | Ludovic Perret |
A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings, pp. 354-370, 2005, Springer, 3-540-25910-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Isomorphism of Polynomials with One Secret (IP1S), Polynomial Linear Equivalence (PLE), Cryptanalysis, Jacobian Matrix |
32 | Sylvia Mermelstein, Memis Acar |
Optimising cam motion using piecewise polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eng. Comput. ![In: Eng. Comput. 19(4), pp. 241-254, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Cam motion synthesis, Optimisation, Piecewise polynomials |
32 | Amir Helzer, Meir Barzohar, David Malah |
Stable Fitting of 2D Curves and 3D Surfaces by Implicit Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 26(10), pp. 1283-1294, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
zero-set sensitivity, curve and surface fitting, stable fitting, Implicit polynomials |
32 | H. Michael Möller, Tomas Sauer |
Multivariate Refinable Functions of High Approximation Order Via Quotient Ideals of Laurent Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 20(1-3), pp. 205-228, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
quotient ideals, Laurent polynomials, Gröbner bases, subdivision |
32 | Anindo Mukherjee, Hongmei Deng, Dharma P. Agrawal |
Distributed Pairwise Key Generation Using Shared Polynomials for Wireless Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MWCN ![In: Mobile and Wireless Communication Networks, IFIP TC6 / WG6.8 Conference on Mobile and Wireless Communication Networks (MWCN 2004), October 25-27, 2004, Paris, France, pp. 215-226, 2004, Kluwer/Springer, 0-387-23148-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Bivariate Polynomials, Security, Ad Hoc Networks, Symmetric Keys, Threshold Secret Sharing |
32 | Pablo A. Parrilo |
Sums of squares of polynomials and their applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2004, Santander, Spain, July 4-7, 2004, Proceedings, pp. 1, 2004, ACM, 1-58113-827-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
semidefinite programming, convex optimization, multivariate polynomials, sum of squares |
32 | Kishan Chand Gupta, Subhamoy Maitra |
Multiples of Primitive Polynomials over GF(2). ![Search on Bibsonomy](Pics/bibsonomy.png) |
INDOCRYPT ![In: Progress in Cryptology - INDOCRYPT 2001, Second International Conference on Cryptology in India, Chennai, India, December 16-20, 2001, Proceedings, pp. 62-72, 2001, Springer, 3-540-43010-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Cryptanalysis, Stream Cipher, Galois Field, Primitive Polynomials, Polynomial Multiples |
32 | Karim Drouiche, Djalil Kateb, Daniel Boichu |
Daubechies-Matzinger wavelets and Lorentz polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 10(3-4), pp. 239-260, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Sobolev regularity ratio, 6A16, wavelets, 42C15, 41A10, Bernstein polynomials |
32 | Manfred Göbel |
Fast Rewriting of Symmetric Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings, pp. 371-381, 1999, Springer, 3-540-66201-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
dynamic power sum representation, fast rewriting techniques, Symmetric polynomials |
32 | Francis K. H. Quek, Vishwas Kulkarni, Cemil Kirbas |
Comparison of Bicubic and Bézier Polynomials for Surface Parameterization in Volumetric Image. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIBE ![In: 3rd IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2003), 10-12 March 2003, Bethesda, MD, USA, pp. 107-114, 2003, IEEE Computer Society, 0-7695-1907-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
mong basis, Bézier polynomials, bicubic polynomials, magnetic resonance angiography, medical imaging, active contours, computed tomography, Surface parameterization |
32 | Nader H. Bshouty, Yishay Mansour |
Simple Learning Algorithms for Decision Trees and Multivariate Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 304-311, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
constant bounded product distribution, /spl epsiv/-approximation, j-disjoint DNF, bounded term size, learning (artificial intelligence), decision trees, interpolation, interpolation, finite fields, polynomials, decision theory, learning algorithms, learnability, multivariate polynomials, membership queries, bounded degree |
32 | Dima Grigoriev, Marek Karpinski |
An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q] ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 662-669, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
bounding ratio, arbitrary polynomials, approximation algorithm, finite fields, polynomial time algorithm, multivariate polynomials, zeros |
32 | Joachim von zur Gathen |
Testing Permutation Polynomials (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 88-92, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
random polynomial-time test, value list, exceptional polynomials, probabilistic variant, Hermite test, probabilistic test, computer algebra, permutation polynomials |
32 | Erich L. Kaltofen, Barry M. Trager |
Computing with Polynomials Given By Black Boxes for Their Evaluation: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 296-305, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
random polynomial time, implicit representation, polynomials, factorization, multivariate polynomials, black boxes, greatest common divisor, rational functions |
32 | Bruno F. W. Whitte |
Algorithms: Algorithm 332: Jacobi polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 11(6), pp. 436-437, 1968. The full citation details ...](Pics/full.jpeg) |
1968 |
DBLP DOI BibTeX RDF |
Jacobi polynomials, orthogonal polynomials, special functions, three-term recurrences |
30 | Zeev Dvir, Ariel Gabizon, Avi Wigderson |
Extractors And Rank Extractors For Polynomial Sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 18(1), pp. 1-58, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Derandomization, Extractors |
30 | Uffe Flarup, Laurent Lyaudet |
On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings, pp. 180-193, 2008, Springer, 978-3-540-79708-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Tomer Kotek, Johann A. Makowsky, Boris Zilber |
On Counting Generalized Colorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings, pp. 339-353, 2008, Springer, 978-3-540-87530-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto, Jürgen Giesl, Salvador Lucas, Peter Schneider-Kamp |
Search Techniques for Rational Polynomial Orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISC/MKM/Calculemus ![In: Intelligent Computer Mathematics, 9th International Conference, AISC 2008, 15th Symposium, Calculemus 2008, 7th International Conference, MKM 2008, Birmingham, UK, July 28 - August 1, 2008. Proceedings, pp. 109-124, 2008, Springer, 978-3-540-85109-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Topics computer algebra systems and automated theorem provers, implementation and performance issues |
30 | Hongbo Li 0012, Lei Huang |
Complex brackets, balanced complex differences, and applications in symbolic geometric computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2008, Linz/Hagenberg, Austria, July 20-23, 2008, Proceedings, pp. 181-188, 2008, ACM, 978-1-59593-904-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bracket algebra, complex numbers method, graph theory, theorem proving, geometric algebra |
30 | Zeev Dvir, Ariel Gabizon, Avi Wigderson |
Extractors and Rank Extractors for Polynomial Sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pp. 52-62, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Philip Koopman, Tridib Chakravarty |
Cyclic Redundancy Code (CRC) Polynomial Selection For Embedded Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DSN ![In: 2004 International Conference on Dependable Systems and Networks (DSN 2004), 28 June - 1 July 2004, Florence, Italy, Proceedings, pp. 145-, 2004, IEEE Computer Society, 0-7695-2052-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Pew-Thian Yap, Paramesran Raveendran, Seng-Huat Ong |
Image analysis by Krawtchouk moments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 12(11), pp. 1367-1377, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Elisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis |
On the Construction of Prime Order Elliptic Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INDOCRYPT ![In: Progress in Cryptology - INDOCRYPT 2003, 4th International Conference on Cryptology in India, New Delhi, India, December 8-10, 2003, Proceedings, pp. 309-322, 2003, Springer, 3-540-20609-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
30 | A. G. Deczky |
Unispherical windows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (2) ![In: Proceedings of the 2001 International Symposium on Circuits and Systems, ISCAS 2001, Sydney, Australia, May 6-9, 2001, pp. 85-88, 2001, IEEE, 0-7803-6685-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
30 | Ana Maria Mandache |
The Gröbner Basis Algorithm and Subresultant Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC '94, Oxford, UK, July 20-22, 1994, pp. 123-128, 1994, ACM, 0-89791-638-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
30 | Dima Grigoriev |
How to Test in Subexponential Time Whether Two Points Can Be Connected by a Curve in a Semialgebraic Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC '90, Tokyo, Japan, August 20-24, 1990, pp. 104-105, 1990, ACM, 0-201-54892-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
30 | Winfried B. Müller, Rupert Nöbauer |
Cryptanalysis of the Dickson Scheme. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '85, Workshop on the Theory and Application of of Cryptographic Techniques, Linz, Austria, April 1985, Proceedings, pp. 50-61, 1985, Springer, 3-540-16468-5. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
30 | Elie Leopold |
Perturbed recurrence relations II the general case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Numer. Algorithms ![In: Numer. Algorithms 44(4), pp. 347-366, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Perturbed orthogonal polynomials system, General recurrence relations with perturbed coefficients, Sobolev recurrence relations, Differential equations, Zeros |
30 | Jintai Ding, Jason E. Gower, Dieter Schmidt, Christopher Wolf, Zhijun Yin |
Complexity Estimates for the F4 Attack on the Perturbed Matsumoto-Imai Cryptosystem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMACC ![In: Cryptography and Coding, 10th IMA International Conference, Cirencester, UK, December 19-21, 2005, Proceedings, pp. 262-277, 2005, Springer, 3-540-30276-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Gröbner basis, public-key, perturbation, multivariate, quadratic polynomials |
30 | Gema M. Diaz-Toca, Laureano González-Vega |
Various New Expressions for Subresultants and Their Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 15(3-4), pp. 233-266, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Subresultant polynomials and roots, Bezout matrix, Matrix theory |
30 | Yuan Xu |
Polynomial Interpolation on the Unit Sphere and on the Unit Ball. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 20(1-3), pp. 247-260, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
interpolation by polynomials, unit sphere, unit ball |
30 | Hoon Hong |
Ore Subresultant Coefficients in Solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 12(5), pp. 421-428, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Ore polynomials, Resultants, Subresultants |
30 | Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio |
Learning functions represented as multiplicity automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 47(3), pp. 506-530, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
learning disjoint, learning polynomials, multiplicity automata, DNF, computational learning |
29 | I. Ben Salah, Pascal Maroni |
The connection between self-associated two-dimensional vector functionals and third degree forms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 13(1), pp. 51-77, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Stieltjes functions, third degree forms, Laguerre-Hahn polynomials, 2-orthogonal polynomials, integral representations, 42C05, 33C45 |
29 | Michael S. Floater, Juan Manuel Peña 0001 |
Tensor-product monotonicity preservation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 9(3-4), pp. 353-362, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
tensor-product surfaces, trigonometric polynomials, control net, B-splines, monotonicity, shape preservation, 41A15, 65D17, Bernstein polynomials |
29 | Leilei Song, Keshab K. Parhi |
Efficient Finite Field Serial/Parallel Multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASAP ![In: 1996 International Conference on Application-Specific Systems, Architectures, and Processors (ASAP '96), August 19-23, 1996, Chicago, IL , USA, pp. 72-, 1996, IEEE Computer Society, 0-8186-7542-X. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
finite field serial/parallel multiplication, finite field arithmetic architectures, bit-serial/parallel finite field multiplier, standard basis representation, optimal primitive polynomials, minimum hardware complexity, semi-systolic architecture, computational complexity, cryptography, cryptography, encoding, digital arithmetic, polynomials, multiplying circuits, VLSI implementation, coding theory |
29 | Yinghua Min, Zhuxing Zhao, Zhongcheng Li |
Boolean process-an analytical approach to circuit representation (II). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 4th Asian Test Symposium (ATS '95), November 23-24, 1995. Bangalore, India, pp. 26-32, 1995, IEEE Computer Society, 0-8186-7129-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
waveform analysis, circuit representation, logical behavior, waveform functions, mathematical tools, waveform polynomials, input transitions, VLSI, Boolean functions, timing, design for testability, logic design, logical design, polynomials, integrated circuit design, VLSI circuits, performance enhancement, timing behavior, Boolean process, circuit delay |
29 | Isaac Weiss |
High-Order Differentiation Filters that Work. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 16(7), pp. 734-739, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
high-order differentiation filters, error source, validity domain, image processing, polynomials, polynomials, filtering and prediction theory, digital images, image smoothing, noise suppression, smooth functions |
29 | Robert A. Hummel, Venkataraman Sundareswaran |
Motion Parameter Estimation from Global Flow Field Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 15(5), pp. 459-476, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
motion parameter estimation, global flow field data, vector flow field, flow circulation algorithm, rotational parameters, FOE search, translational parameters, circular-surround zero-mean receptive fields, computer vision, motion estimation, parameter estimation, filtering, polynomials, filtering and prediction theory, quadratic polynomials, imaging system |
29 | Xavier Merrheim, Jean-Michel Muller, Hong-Jin Yeh |
Fast evaluation of polynomials and inverses of polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Symposium on Computer Arithmetic ![In: 11th Symposium on Computer Arithmetic, 29 June - 2 July 1993, Windsor, Canada, Proceedings., pp. 186-192, 1993, IEEE Computer Society/, 0-8186-3862-1. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
27 | Akira Terui |
An iterative method for calculating approximate GCD of univariate polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings, pp. 351-358, 2009, ACM, 978-1-60558-609-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximate polynomial gcd, gradient-projection method, optimization, ill-conditioned problem |
27 | Jean-Charles Faugère, Ludovic Perret |
High order derivatives and decomposition of multivariate polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings, pp. 207-214, 2009, ACM, 978-1-60558-609-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
gröbner basis, multivariate cryptology, public key cryptography, cryptology, algebraic cryptanalysis, f5 algorithm |
27 | Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton |
Polynomials that Sign Represent Parity and Descartes' Rule of Signs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(3), pp. 377-406, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification |
27 | Guobiao Weng, Chaoping Dong |
A Note on Permutation Polynomials Over BBZ n. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(9), pp. 4388-4390, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Markus Bläser, Moritz Hardt, David Steurer |
Asymptotically Optimal Hitting Sets Against Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 345-356, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Hajime Machida, Tamás Waldhauser |
Majority and Other Polynomials in Minimal Clones. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 38th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2008), 22-23 May 2008, Dallas, Texas, USA, pp. 38-43, 2008, IEEE Computer Society, 978-0-7695-3155-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
minimal clone, polynomial, clone, Galois field |
27 | Shachar Lovett |
Unconditional pseudorandom generators for low degree polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 557-562, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
fourier analysis, pseudorandom generators, low degree tests |
27 | Zeev Dvir, Amir Shpilka |
Noisy Interpolating Sets for Low Degree Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 140-148, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Error correcting codes, Polynomial interpolation |
27 | María Álvarez de Morales, Lidia Fernández, Teresa E. Pérez, Miguel A. Piñar |
On differential properties for bivariate orthogonal polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Numer. Algorithms ![In: Numer. Algorithms 45(1-4), pp. 153-166, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 42C05, 33C50 |
27 | Sofiya Ostrovska |
The approximation of logarithmic function by q -Bernstein polynomials in the case q>1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Numer. Algorithms ![In: Numer. Algorithms 44(1), pp. 69-82, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 41A10, 30E10 |
27 | Doru Stefanescu |
Bounds for Real Roots and Applications to Orthogonal Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASC ![In: Computer Algebra in Scientific Computing, 10th International Workshop, CASC 2007, Bonn, Germany, September 16-20, 2007, Proceedings, pp. 377-391, 2007, Springer, 978-3-540-75186-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Masanari Kida |
Cyclic Polynomials Arising from Kummer Theory of Norm Algebraic Tori. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANTS ![In: Algorithmic Number Theory, 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006, Proceedings, pp. 102-113, 2006, Springer, 3-540-36075-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
27 | Abusaleh M. Jabir, Dhiraj K. Pradhan, Jimson Mathew |
An efficient technique for synthesis and optimization of polynomials in GF(2m). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 2006 International Conference on Computer-Aided Design, ICCAD 2006, San Jose, CA, USA, November 5-9, 2006, pp. 151-157, 2006, ACM, 1-59593-389-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
27 | Yoo-Joo Choi, Yeon Ju Lee, Jungho Yoon, Byung-Gook Lee, Young J. Kim |
A New Class of Non-stationary Interpolatory Subdivision Schemes Based on Exponential Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GMP ![In: Geometric Modeling and Processing - GMP 2006, 4th International Conference, Pittsburgh, PA, USA, July 26-28, 2006, Proceedings, pp. 563-570, 2006, Springer, 3-540-36711-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
27 | Jing Sun, Oscar Y. Takeshita |
Interleavers for turbo codes using permutation polynomials over integer rings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(1), pp. 101-119, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
27 | Johannes Blömer, Alexander May 0001 |
A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings, pp. 251-267, 2005, Springer, 3-540-25910-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Coppersmiths method, univariate vs. bivariate, RSA |
27 | Venkat Ramachandran, Majid Ahmadi, Christian S. Gargour |
Some properties of generalized 2-D mirror image and anti mirror image polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (3) ![In: International Symposium on Circuits and Systems (ISCAS 2005), 23-26 May 2005, Kobe, Japan, pp. 2321-2324, 2005, IEEE, 0-7803-8834-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
27 | Kosaku Nagasaka |
Towards More Accurate Separation Bounds of Empirical Polynomials II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASC ![In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, Kalamata, Greece, September 12-16, 2005, Proceedings, pp. 318-329, 2005, Springer, 3-540-28966-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
27 | Elisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis |
On the Use of Weber Polynomials in Elliptic Curve Cryptography. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroPKI ![In: Public Key Infrastructure, First European PKIWorkshop: Research and Applications, EuroPKI 2004, Samos Island, Greece, June 25-26, 2004, Proceedings, pp. 335-349, 2004, Springer, 3-540-22216-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Michael Schmitt 0001 |
An Improved VC Dimension Bound for Sparse Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 17th Annual Conference on Learning Theory, COLT 2004, Banff, Canada, July 1-4, 2004, Proceedings, pp. 393-407, 2004, Springer, 3-540-22282-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Dimitrios Triantafyllou, Marilena Mitrouli |
Two Resultant Based Methods Computing the Greatest Common Divisor of Two Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NAA ![In: Numerical Analysis and Its Applications, Third International Conference, NAA 2004, Rousse, Bulgaria, June 29 - July 3, 2004, Revised Selected Papers, pp. 519-526, 2004, Springer, 3-540-24937-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Greater Common Divisor, Sylvester matrix, Gaussian elimination, QR factorization |
27 | Fatima Abu Salem, Shuhong Gao, Alan G. B. Lauder |
Factoring polynomials via polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2004, Santander, Spain, July 4-7, 2004, Proceedings, pp. 4-11, 2004, ACM, 1-58113-827-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Newton polytope, factorisation, multivariate polynomial |
27 | Dimitri Kagaris, Spyros Tragoudas |
LFSR Characteristic Polynomials for Pseudo-Exhaustive TPG with Low Number of Seeds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Electron. Test. ![In: J. Electron. Test. 19(3), pp. 233-244, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
built-in self-test (BIST), Linear Feedback Shift Registers (LFSR), test pattern generation (TPG) |
27 | Martin Ziegler 0001 |
Quasi-optimal Arithmetic for Quaternion Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings, pp. 705-715, 2003, Springer, 3-540-20695-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
27 | Jason E. Gower |
Rotations and Translations of Number Field Sieve Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2003, 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30 - December 4, 2003, Proceedings, pp. 302-310, 2003, Springer, 3-540-20592-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
27 | Richard C. Wilson 0001, Edwin R. Hancock |
Pattern spaces from graph polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIAP ![In: 12th International Conference on Image Analysis and Processing (ICIAP 2003), 17-19 September 2003, Mantova, Italy, pp. 480-485, 2003, IEEE Computer Society, 0-7695-1948-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
27 | Daniel Panario |
What Do Random Polynomials over Finite Fields Look Like? ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Finite Fields and Applications ![In: Finite Fields and Applications, 7th International Conference, Fq7, Toulouse, France, May 5-9, 2003, Revised Papers, pp. 89-108, 2003, Springer, 3-540-21324-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
27 | Bernhard Beckermann, Howard Cheng, George Labahn |
Fraction-free row reduction of matrices of skew polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2002, Lille, France, July 7-10, 2002, Proceedings, pp. 8-15, 2002, ACM, 1-58113-484-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Amir Shpilka |
Affine Projections of Symmetric Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pp. 160-171, 2001, IEEE Computer Society, 0-7695-1053-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
27 | Jamie Mulholland, Michael B. Monagan |
Algorithms for trigonometric polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ISSAC 2001, ORCCA & University of Western Ontario, London, Ontario, Canada, July 22-25, 2001, pp. 245-252, 2001, ACM, 1-58113-417-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
27 | Nicos Karcanias, Marilena Mitrouli |
Numerical Computation of the Least Common Multiple of a Set of Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reliab. Comput. ![In: Reliab. Comput. 6(4), pp. 439-457, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
27 | Dima Grigoriev, Nicolai N. Vorobjov Jr. |
Bounds on numers of vectors of multiplicities for polynomials which are easy to compute. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, ISSAC 2000, St. Andrews, United Kingdom, August 6-10, 2000, pp. 137-146, 2000, ACM, 1-58113-218-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
27 | Alper Halbutogullari, Çetin Kaya Koç |
Mastrovito Multiplier for General Irreducible Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 13th International Symposium, AAECC-13, Honolulu, Hawaii, USA, November 15-19, 1999, Proceedings, pp. 498-507, 1999, Springer, 3-540-66723-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
27 | Jacques Patarin, Louis Goubin, Nicolas T. Courtois |
Improved Algorithms for Isomorphisms of Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31 - June 4, 1998, Proceeding, pp. 184-200, 1998, Springer, 3-540-64518-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
27 | Wun-Seng Chou |
On inversive maximal period polynomials over finite fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 6(4/5), pp. 245-250, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Pseudorandon Number, Recurring Sequence, Finite Field, Polynomial |
27 | Ralph G. Selfridge |
Solving Two or Three Polynomials in Two or Three Variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APL ![In: Proceedings of the International Conference on APL 1993, Toronto, Ontario, Canada, August 15-19, 1993., pp. 214-218, 1993, ACM, 0-89791-612-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
APL |
Displaying result #101 - #200 of 9920 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ >>] |
|