|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 12402 occurrences of 4451 keywords
|
|
|
Results
Found 28003 publication records. Showing 28003 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
53 | Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan 0001 |
New Results on Noncommutative and Commutative Polynomial Identity Testing. ![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. 268-279, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
randomized, polynomial time, deterministic, polynomial identity testing |
47 | Mark Giesbrecht, Daniel S. Roche |
On lacunary polynomial perfect powers. ![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. 103-110, 2008, ACM, 978-1-59593-904-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
black box polynomial, lacunary polynomial, perfect power, sparse polynomial |
47 | Zeev Dvir, Amir Shpilka |
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 592-601, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
depth 3 circuits, locally decodable codes, polynomial identity testing |
47 | Boaz Barak, Yehuda Lindell |
Strict polynomial-time in simulation and extraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 484-493, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
44 | Erich L. Kaltofen |
Polynomial factorization: a success story. ![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. 3-4, 2003, ACM, 1-58113-641-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
black box polynomial, randomized algorithm, polynomial factorization, lattice basis reduction, symbolic/numeric hybrid method, straight line program |
43 | László Babai, Lajos Rónyai |
Computing Irreducible Representations of Finite Groups ![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. 93-98, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
deterministic polynomial time, matrices list, randomized polynomial time, Las Vegas polynomial time, generators set, bit complexity, inequivalent irreducible representations, multiplication table, polynomial-size description, absolutely irreducible constituents, polynomial-time algorithm, equivalence class, finite groups, complex numbers, exact computations, algebraic number fields |
41 | Omer Giménez, Petr Hlinený, Marc Noy |
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 59-68, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
subexponential algorithm, U polynomial, cographs, clique-width, Tutte polynomial |
41 | Rainer Schuler |
A Note on Universal Distributions for Polynomial-Time Computable Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 69-73, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
40 | Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay Raghavan 0002, Dawn Wilkins |
How Many Queries Are Needed to Learn? ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 43(5), pp. 840-862, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
exact identification, polynomial-query learning, polynomial-time learning, proper learning, certificates, membership queries, equivalence queries, polynomial-time hierarchy |
39 | Noga Alon, Alan M. Frieze, Dominic Welsh |
Polynomial time randomised approxmiation schemes for the Tutte polynomial of dense graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 24-35, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
polynomial time randomised approximation schemes, dense graphs, Tutte-Grothendieck polynomial, combinatorial quantities, spanning forests, strongly connected orientations, k-colorings, reliability probability, P-hard, ferromagnetic Q-state Potts model, linear matroids, weight enumerator, linear codes, partition functions, Tutte polynomial |
38 | Zohar Shay Karnin, Amir Shpilka |
Black Box Polynomial Identity Testing of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-In. ![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. 280-291, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
PIT, depth-3, arithmetic circuit, deterministic, polynomial identity testing |
38 | Kazushige Terui |
Light affine lambda calculus and polynomial time strong normalization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 46(3-4), pp. 253-280, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Light logics, Lambda calculus, Polynomial time |
38 | Alin Bostan, Thomas Cluzeau, Bruno Salvy |
Fast algorithms for polynomial solutions of linear differential equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, pp. 45-52, 2005, ACM, 1-59593-095-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
complexity, computer algebra, linear recurrences, linear differential equations, polynomial solutions |
38 | Chengjun Liu |
Gabor-Based Kernel PCA with Fractional Power Polynomial Models for Face Recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 26(5), pp. 572-581, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
fractional power polynomial models, Gabor wavelet representation, Gabor-based kernel PCA method, Face recognition, kernel Principal Component Analysis (PCA) |
36 | Peter Bürgisser, Felipe Cucker |
Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 503-512, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
approximate zero, polynomial equation solving, complexity, polynomial time, smoothed analysis, homotopy methods |
36 | Dorit Aharonov, Vaughan Jones, Zeph Landau |
A polynomial quantum algorithm for approximating the Jones polynomial. ![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. 427-436, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Jones Polynomial, Temperley-Lieb, braids, unitary representation, algorithm, approximation, knots, quantum |
36 | Arfst Nickelsen, Till Tantau |
Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings, pp. 299-310, 2001, Springer, 3-540-42487-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
polynomial time reductions, verboseness, p-selectivity, positive reductions, structural complexity, partial information |
35 | Michel Cosnard, Pierre Fraigniaud |
Analysis of Asynchronous Polynomial Root Finding Methods on a Distributed Memory Multicomputer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(6), pp. 639-648, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
poles and zeros, distributed memorysystems, asynchronous polynomial root finding, iterative polynomial root finding, locally convergent, asynchronous methods, synchronous, convergence, polynomials, convergence of numerical methods, distributed memory multicomputer, hypercube multicomputer, polynomial zeros |
35 | Sung-Kwun Oh, James F. Peters, Witold Pedrycz, Tae-Chon Ahn |
Genetically Optimized Rule-Based Fuzzy Polynomial Neural Networks: Synthesis of Computational Intelligence Technologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSFDGrC ![In: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 9th International Conference, RSFDGrC 2003, Chongqing, China, May 26-29, 2003, Proceedings, pp. 437-444, 2003, Springer, 3-540-14040-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Rule-base fuzzy polynomial neural networks(RFPNN), rule-based fuzzy neural networks(RFNN), polynomial neural networks(PNN), computational intelligence(CI), genetic algorithms(GAs), design methodology |
35 | Pascal Giorgi, Claude-Pierre Jeannerod, Gilles Villard |
On the complexity of polynomial matrix computations. ![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. 135-142, 2003, ACM, 1-58113-641-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
column reduced form, matrix gcd, matrix polynomial, minimal basis, polynomial matrix multiplication, determinant |
35 | Yuan Xu 0005 |
Polynomial interpolation in several variables, cubature formulae, and ideals[*]Supported by the National Science Foundation under Grant DMS-9802265. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 12(4), pp. 363-376, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
polynomial interpolation in several variables, 65D05, 41A63, orthogonal polynomials, variety, 41A05, 41A10, polynomial ideals, 13P10, cubature formulae |
35 | Valentine Kabanets, Russell Impagliazzo |
Derandomizing polynomial identity tests means proving circuit lower bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 355-364, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
BPP, NEXP, circuit lower bounds, derandomization, polynomial identity testing |
35 | Masayuki Noro, Kazuhiro Yokoyama |
Yet another practical implementation of polynomial factorization over finite fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2002, Lille, France, July 7-10, 2002, Proceedings, pp. 200-206, 2002, ACM, 1-58113-484-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
35 | Luc Longpré, Osamu Watanabe 0001 |
On Symmetry of Information and Polynomial Time Invertibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings, pp. 410-419, 1992, Springer, 3-540-56279-6. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
35 | Leonid Khachiyan, Lorant Porkolab |
Computing Integral Points in Convex Semi-algebraic Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 162-171, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
convex semi-algebraic sets, polynomial inequalities, linear integer programming, semidefinite integer programming, integer programming, polynomial-time algorithm, polynomial-time solvability |
34 | Ran Raz |
Tensor-rank and lower bounds for arithmetic formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 659-666, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
homogenous circuits, multilinear circuits, tensor rank, lower bounds, arithmetic circuits |
34 | Ran Raz |
Elusive functions and lower bounds for arithmetic circuits. ![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. 711-720, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bounded depth circuits, lower bounds, arithmetic circuits, circuit complexity |
33 | Sung-Kwun Oh, Witold Pedrycz |
Genetically Optimized Self-organizing Neural Networks Based on Polynomial and Fuzzy Polynomial Neurons: Analysis and Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Engineering Evolutionary Intelligent Systems ![In: Engineering Evolutionary Intelligent Systems, pp. 59-108, 2008, Springer, 978-3-540-75395-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Petr Husek, Renata Pytelková |
On Polynomial and Polynomial Matrix Interpolation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (2) ![In: Computational Science - ICCS 2002, International Conference, Amsterdam, The Netherlands, April 21-24, 2002. Proceedings, Part II, pp. 520-527, 2002, Springer, 3-540-43593-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | Alberto Bertoni, Paola Campadelli, Anna Morpurgo, Sandra Panizza |
Polynomial Iniform Convergence and Polynomial-Sample Learnability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, COLT 1992, Pittsburgh, PA, USA, July 27-29, 1992., pp. 265-271, 1992, ACM, 0-89791-497-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
33 | Hiroshi Sekigawa, Kiyoshi Shirayanagi |
On the Location of Pseudozeros of a Complex Interval Polynomial. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 1(2), pp. 321-335, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Interval polynomial, polynomial, convex set, zero |
33 | Jean-Guillaume Dumas, Clément Pernet, Zhendong Wan |
Efficient computation of the characteristic polynomial. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, pp. 140-147, 2005, ACM, 1-59593-095-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Keller-Gehrig, Magma, finite field, probabilistic algorithm, characteristic polynomial, integer, minimal polynomial |
33 | Arash Reyhani-Masoleh, M. Anwarul Hasan |
On Low Complexity Bit Parallel Polynomial Basis Multipliers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHES ![In: Cryptographic Hardware and Embedded Systems - CHES 2003, 5th International Workshop, Cologne, Germany, September 8-10, 2003, Proceedings, pp. 189-202, 2003, Springer, 3-540-40833-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Finite or Galois field, Mastrovito multiplier, pentanomial, trinomial and equally-spaced polynomial, polynomial basis |
32 | Jonathan Katz, Yehuda Lindell |
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 21(3), pp. 303-349, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Expected polynomial-time, Black-box simulation, Zero-knowledge, Secure multiparty computation |
32 | Arash Hariri, Arash Reyhani-Masoleh |
Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAIFI ![In: Arithmetic of Finite Fields, 2nd International Workshop, WAIFI 2008, Siena, Italy, July 6-9, 2008, Proceedings, pp. 103-116, 2008, Springer, 978-3-540-69498-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Shifted polynomial basis, binary extension fields, digit-serial, multiplication |
32 | Masakazu Kojima, Masakazu Muramatsu |
An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 110(2), pp. 315-336, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Polynomial optimization problem, Symmetric cone, Euclidean Jordan algebra, Global optimization, Semidefinite program, Sum of squares, Conic program |
32 | Hiroshi Sekigawa, Kiyoshi Shirayanagi |
Locating real multiple zeros of a real interval polynomial. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, July 9-12, 2006, Proceedings, pp. 310-317, 2006, ACM, 1-59593-276-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
interval polynomial, real multiple zero, convex set |
32 | Manh Thang Nguyen, Danny De Schreye |
Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP ![In: Logic Programming, 21st International Conference, ICLP 2005, Sitges, Spain, October 2-5, 2005, Proceedings, pp. 311-325, 2005, Springer, 3-540-29208-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
polynomial interpretations, acceptability, Termination analysis |
32 | Roberto Barrio |
A Unified Rounding Error Bound for Polynomial Evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 19(4), pp. 385-399, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
recurrence relations, polynomial evaluation, rounding errors |
32 | Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka |
The Black-Box Query Complexity of Polynomial Summation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 18(1), pp. 59-79, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Subject classification. 68Q05, 68Q17, 68Q25, 68Q15 |
32 | Yaohui Li, Yong Feng, Jiwei Xue |
An Improved Method for Computing Dixon Polynomial. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICYCS ![In: Proceedings of the 9th International Conference for Young Computer Scientists, ICYCS 2008, Zhang Jia Jie, Hunan, China, November 18-21, 2008, pp. 19-24, 2008, IEEE Computer Society, 978-0-7695-3398-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Arthur D. Chtcherba, Deepak Kapur |
Support hull: relating the cayley-dixon resultant constructions to the support of a polynomial system. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2004, Santander, Spain, July 4-7, 2004, Proceedings, pp. 95-102, 2004, ACM, 1-58113-827-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
dialytic method, dixon resultant formulation, support hull, support-hull interior point, sylvester-type matrices, support, resultant, variable ordering |
32 | Erich L. Kaltofen, Zhengfeng Yang, Lihong Zhi |
Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, July 9-12, 2006, Proceedings, pp. 169-176, 2006, ACM, 1-59593-276-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
approximate multiple root, approximate polynomial gcd, multivariate polynomial gcd, singular polynomial, linear constraint, symbolic/numeric hybrid method |
32 | Linda Alvord, Tama Traberman |
When bears are blue and bulls are red. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APL ![In: Proceedings of the International Conference on all Array Programming Languages, ALP 1999, Scranton, PA, USA, August 10-14, 1999., pp. 13-19, 1999, ACM, 1-58113-126-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
APL |
30 | Hiroki Arimura, Takeaki Uno |
An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 13(3), pp. 243-262, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Maximal motif, Data mining, Algorithm, Delay, Polynomial time, Pattern discovery, Enumeration, Motif, Sequence mining, Closed pattern, Closed itemset |
30 | Dorit Aharonov, Vaughan Jones, Zeph Landau |
A Polynomial Quantum Algorithm for Approximating the Jones Polynomial. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(3), pp. 395-421, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Yoshio Okamoto, Takeaki Uno |
A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 609-620, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Jianping Li 0007, Weidong Li 0002, Jianbo Li |
Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 1-13, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Scheduling, allocation, polynomial time approximation scheme, fully polynomial time approximation scheme, grade of service |
30 | Arne Storjohann, Gilles Villard |
Computing the rank and a small nullspace basis of a polynomial matrix. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, pp. 309-316, 2005, ACM, 1-59593-095-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
matrix rank, minimal polynomial basis, nullspace basis, polynomial matrix, linear algebra |
30 | Joachim von zur Gathen, Igor E. Shparlinski |
Polynomial interpolation from multiples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 1132-1137, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
black box polynomial, hidden polynomial, integer lattices, short vectors, approximate computation |
30 | Don Coppersmith |
Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 10(4), pp. 233-260, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
RSA, RSA, Polynomial, Polynomial, Factoring, Factoring, Key words |
30 | Ching-Chih Han, Hung-Ying Tyan |
A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTSS ![In: Proceedings of the 18th IEEE Real-Time Systems Symposium (RTSS '97), December 3-5, 1997, San Francisco, CA, USA, pp. 36-45, 1997, IEEE Computer Society, 0-8186-8268-X. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
polynomial-time schedulability test, real-time fixed-priority scheduling algorithms, closed-form utilization, polynomial-time schedulability, processor scheduling, schedulability condition |
30 | Thomas E. Hull, Rudolf Mathon |
The Mathematical Basis and a Prototype Implementation of a New Polynomial Rootfinder With Quadratic Convergence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 22(3), pp. 261-280, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
polynomial rootfinder, polynomial zerofinder, quadratic convergence |
30 | Ker-I Ko, Klaus Weihrauch |
On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996, pp. 150-159, 1996, IEEE Computer Society, 0-8186-7386-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Lebesgue measure, two-dimensional region, polynomial-time computable boundary, interior region, polynomial-time computable, computational complexity, computability, computability, Turing machines |
30 | Zeljko Zilic, Zvonko G. Vranesic |
Reed-Muller Forms for Incompletely Specified Functions via Sparse Polynomial Interpolation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 25th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1995, Bloomington, Indiana, USA, May 23-25, 1995, Proceedings, pp. 36-43, 1995, IEEE Computer Society, 0-8186-7118-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Reed-Muller forms, sparse polynomial interpolation, MVL RM transforms, interpolation, multivalued logic, Reed-Muller codes, polynomial interpolation, incompletely specified functions, computationally efficient algorithm |
30 | S. Y. Ku, R. J. Adler |
Computing polynomial resultants: Bezout's determinant vs. Collins' reduced P.R.S. algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 12(1), pp. 23-30, 1969. The full citation details ...](Pics/full.jpeg) |
1969 |
DBLP DOI BibTeX RDF |
Bezout's determinant, Sylvester's determinant, g.c.d algorithm, multivariate polynomial equations, polynomial resultant, reduced p.r.s algorithm, resultant algorithm, Euclidean algorithm, elimination |
30 | Terence R. F. Nonweiler |
Algorithms: Algorithm 326: Roots of low-order polynomial equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 11(4), pp. 269-270, 1968. The full citation details ...](Pics/full.jpeg) |
1968 |
DBLP DOI BibTeX RDF |
biquadratic equation roots, cubic equation roots, polynomial equation roots, quadratic equation roots, rootfinders, polynomial zeros |
30 | Jinfeng Wang 0003, Kwong-Sak Leung, Kin-Hong Lee, Zhenyuan Wang |
Polynomial Nonlinear Integrals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (1) ![In: Advances in Neural Networks - ISNN 2008, 5th International Symposium on Neural Networks, ISNN 2008, Beijing, China, September 24-28, 2008, Proceedings, Part I, pp. 539-548, 2008, Springer, 978-3-540-87731-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Nonlinear integrals, Polynomial nonlinear integrals, Classification, Projection |
30 | Nicolas Brisebarre, Jean-Michel Muller, Arnaud Tisserand |
Computing machine-efficient polynomial approximations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 32(2), pp. 236-256, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
minimax approximation, linear programming, floating-point arithmetic, polytopes, Polynomial approximation, Chebyshev polynomials |
30 | Payman Mohassel, Matthew K. Franklin |
Efficient Polynomial Operations in the Shared-Coefficients Setting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Public Key Cryptography ![In: Public Key Cryptography - PKC 2006, 9th International Conference on Theory and Practice of Public-Key Cryptography, New York, NY, USA, April 24-26, 2006, Proceedings, pp. 44-57, 2006, Springer, 3-540-33851-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
polynomial operations, threshold homomorphic encryption, privacy-preserving set operations, secure multi-party computation, passive adversary |
30 | Evelyne Contejean, Claude Marché, Ana Paula Tomás, Xavier Urbain |
Mechanically Proving Termination Using Polynomial Interpretations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 34(4), pp. 325-363, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
polynomial interpretations, termination, term rewriting |
30 | Kurt Jetter, Georg Zimmermann |
Polynomial Reproduction in Subdivision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 20(1-3), pp. 67-86, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
vector subdivision, polynomial reproduction |
30 | Huapeng Wu |
Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 51(7), pp. 750-758, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
hardware architecture, Finite fields arithmetic, polynomial basis |
30 | Ligang Liu, Guojin Wang |
Recursive Formulae for Hermite Polynomial Approximations to Rational Bézier Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GMP ![In: Geometric Modeling and Processing 2000, Hong Kong, China, April 10-12, 2000, pp. 190-197, 2000, IEEE Computer Society, 0-7695-0562-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Rational Bézier curve, hybrid curve, Hermite curve, polynomial approximation |
30 | Ilya Averbouch, Benny Godlin, Johann A. Makowsky |
A Most General Edge Elimination Polynomial. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers, pp. 31-42, 2008, 978-3-540-92247-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Helmut Seidl, Andrea Flexeder, Michael Petter |
Analysing All Polynomial Equations in . ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 15th International Symposium, SAS 2008, Valencia, Spain, July 16-18, 2008. Proceedings, pp. 299-314, 2008, Springer, 978-3-540-69163-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Amir Shpilka, Ilya Volkovich |
Read-once polynomial identity testing. ![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. 507-516, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bounded depth circuits, identity testing, read-once formulas, reconstruction, arithmetic circuits |
29 | Josep M. Brunat, Antonio Montes |
The characteristic ideal of a finite, connected, regular graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2004, Santander, Spain, July 4-7, 2004, Proceedings, pp. 50-57, 2004, ACM, 1-58113-827-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
characteristic ideal, galois graph, polynomial digraph, polynomial graph, strongly polynomial graph, variety of a pairing, pairing, connected component, conjecture |
29 | Hiroki Arimura, Takeaki Uno, Shinichi Shimozono |
Time and Space Efficient Discovery of Maximal Geometric Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discovery Science ![In: Discovery Science, 10th International Conference, DS 2007, Sendai, Japan, October 1-4, 2007, Proceedings, pp. 42-55, 2007, Springer, 978-3-540-75487-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
closed graph mining, rightmost expansion, polynomial delay polynomial space enumeration algorithms, depth-first search, geometric graphs |
29 | 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 |
29 | Victor Y. Pan |
Univariate polynomials: nearly optimal algorithms for factorization and rootfinding. ![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. 253-267, 2001, ACM, 1-58113-417-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Graeffe's lifting, Padé approximation, geometry of polynomial zeros, numerical polynomial factorization, rootfinding, univariate polynomials, computational complexity |
29 | Zhibin Lei, Daniel Keren, David B. Cooper |
Computationally fast Bayesian recognition of complex objects based on mutual algebraic invariants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings 1995 International Conference on Image Processing, Washington, DC, USA, October 23-26, 1995, pp. 635-638, 1995, IEEE Computer Society, 0-8186-7310-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
computationally fast Bayesian recognition, complex objects recognition, 2D curve, 3D surface objects, Euclidean invariants, polynomial coefficients, Bayesian object recognition, robust recognition, mutual invariants recognizers, self invariants, object geometry, low computational cost, partially occluded articulated objects, joint geometry, self geometry, mutual algebraic invariants, database, computational geometry, object recognition, noise, polynomials, polynomial, vector, position, Bayes methods, patches, affine invariants |
29 | Marc Moreno Maza, Yuzhen Xie |
An implementation report for parallel triangular decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006, pp. 235, 2006, ACM, 1-59593-452-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
polynomial system solver, parallel execution |
29 | Thomas Eiter, Kazuhisa Makino |
Generating All Abductive Explanations for Queries on Propositional Horn Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings, pp. 197-211, 2003, Springer, 3-540-40801-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Horn theories, polynomial total time computation, NP-hardness, abduction, propositional logic, Computational logic |
28 | Sung-Kwun Oh, Hyun-Ki Kim |
Genetically Optimized Hybrid Fuzzy Polynomial Neural Networks Based on Polynomial and Fuzzy Polynomial Neurons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australian Conference on Artificial Intelligence ![In: AI 2005: Advances in Artificial Intelligence, 18th Australian Joint Conference on Artificial Intelligence, Sydney, Australia, December 5-9, 2005, Proceedings, pp. 1116-1119, 2005, Springer, 3-540-30462-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Michael V. Basin, Peng Shi 0001, Darío Calderon-Alvarez |
Optimal filtering for polynomial states over polynomial observations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008, December 9-11, 2008, Cancún, Mexico, pp. 5128-5133, 2008, IEEE, 978-1-4244-3123-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Xumin Liu, Weixiang Xu, Yong Guan, Yuanyuan Shang |
Trigonometric polynomial uniform B-spline surface with shape parameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIS ![In: Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human (ICIS 2009), Seoul, Korea, 24-26 November 2009, pp. 1357-1363, 2009, ACM, 978-1-60558-710-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
trigonometric polynomial uniform B-spline with shape parameters, uniform trigonometric polynomial B-spline, C++, computer graphics, surface modeling, computer aided geometric design |
27 | Jaewook Chung, M. Anwar Hasan |
Montgomery Reduction Algorithm for Modular Multiplication Using Low-Weight Polynomial Form Integers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Symposium on Computer Arithmetic ![In: 18th IEEE Symposium on Computer Arithmetic (ARITH-18 2007), 25-27 June 2007, Montpellier, France, pp. 230-239, 2007, IEEE Computer Society, 0-7695-2854-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
More generalized Mersenne numbers, Low-weight polynomial form integers, adapted modular number system, polynomial modular number system, Montgomery reduction algorithm |
27 | Haining Fan, M. Anwar Hasan |
Relationship between GF(2m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 55(9), pp. 1202-1206, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Montgomery multiplication algorithm, shifted polynomial basis, Finite field, multiplication, polynomial basis, irreducible trinomial |
27 | Joseph M. Francos, Benjamin Friedlander |
The polynomial phase difference operator for modeling of nonhomogeneous images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings 1995 International Conference on Image Processing, Washington, DC, USA, October 23-26, 1995, pp. 276-279, 1995, IEEE Computer Society, 0-8186-7310-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
polynomial phase difference operator, nonhomogeneous images, 2D signals, constant modulus polynomial-phase model, parameter estimation algorithm, phase differencing operator, modelling, modeling, image processing, parameter estimation, polynomials |
27 | Michel Cosnard, Pierre Fraigniaud |
A Performance Analysis of Network Topologies in Finding the Roots of a Polynomial. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONPAR ![In: CONPAR 90 - VAPP IV, Joint International Conference on Vector and Parallel Processing, Zurich, Switzerland, September 10-13, 1990, Proceedings, pp. 875-886, 1990, Springer, 3-540-53065-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
local memory parallel computers, simultaneous polynomial root-finders, Parallel algorithms, broadcasting, polynomial zeros |
27 | Guojun Li, Xiaotie Deng, Ying Xu 0001 |
A polynomial-time approximation scheme for embedding hypergraph in a cycle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(2), pp. 20:1-20:12, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Hypergraph embedding, minimum congestion, NP-hard, polynomial-time approximation scheme |
27 | Cristina Borralleras, Salvador Lucas, Rafael Navarro-Marset, Enric Rodríguez-Carbonell, Albert Rubio |
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-22, 22nd International Conference on Automated Deduction, Montreal, Canada, August 2-7, 2009. Proceedings, pp. 294-305, 2009, Springer, 978-3-642-02958-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
polynomial constraints, SAT modulo theories, program analysis, termination, Constraint solving |
27 | Omid Sarbishei, Bijan Alizadeh, Masahiro Fujita |
Polynomial datapath optimization using partitioning and compensation heuristics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 46th Design Automation Conference, DAC 2009, San Francisco, CA, USA, July 26-31, 2009, pp. 931-936, 2009, ACM, 978-1-60558-497-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
modular HED, polynomial datapath, high-level synthesis |
27 | Martin Mevissen, Kosuke Yokoyama, Nobuki Takayama |
Solutions of polynomial systems derived from the steady cavity flow problem. ![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. 255-262, 2009, ACM, 978-1-60558-609-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
finite difference discretization, polynomial optimization, semidefinite programming relaxation, steady cavity flow problem, sparsity |
27 | Daniel Andres, Viktor Levandovskyy, Jorge Martín-Morales |
Principal intersection and bernstein-sato polynomial of an affine variety. ![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. 231-238, 2009, ACM, 978-1-60558-609-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bernstein-sato polynomial of variety, initial ideal, intersection with subalgebra, non-commutative gr?bner bases, preimage of ideal, annihilator, d-modules |
27 | Changbo Chen, Marc Moreno Maza, Wei Pan 0001, Yuzhen Xie |
On the verification of polynomial system solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Frontiers Comput. Sci. China ![In: Frontiers Comput. Sci. China 2(1), pp. 55-66, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
polynomial system solver, software verification, triangular decomposition |
27 | Christophe Roland, R. Varadhan, C. E. Frangakis |
Squared polynomial extrapolation methods with cycling: an application to the positron emission tomography problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Numer. Algorithms ![In: Numer. Algorithms 44(2), pp. 159-172, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Fixed-point methods, Polynomial extrapolation methods, Nonlinear systems, Linear systems, Squaring |
27 | Jin-Song Wang, Wen-Feng Qi 0001 |
Linear Equation on Polynomial Single Cycle T-Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inscrypt ![In: Information Security and Cryptology, Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers, pp. 256-270, 2007, Springer, 978-3-540-79498-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
single cycle, pseudorandom generator, polynomial function |
27 | Cheng-Hsiung Hsieh, Ren-Hsien Huang, Ting-Yu Feng |
One-Dimensional Grey Polynomial Interpolators for Image Enlargement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACIS-ICIS ![In: 6th Annual IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007), 11-13 July 2007, Melbourne, Australia, pp. 450-456, 2007, IEEE Computer Society, 0-7695-2841-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Grey First Order Accumulated Generating Operation, Image Enlargement, Polynomial Interpolation |
27 | Sergey P. Tarasov, Mikhail N. Vyalyi |
An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings, pp. 397-406, 2007, Springer, 978-3-540-74509-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
algorithm, sparse representation, root of unity, cyclotomic polynomial |
27 | Yufu Chen, Xiaohui Meng |
Border bases of positive dimensional polynomial ideals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SNC ![In: Symbolic-Numeric Computation, SNC 2007, International Workshop, 25-27 July 2007, University of Western Ontario, London, Ontario, Canada, pp. 65-71, 2007, ACM, 978-1-59593-744-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
border basis, algorithm, polynomial ideal |
27 | Byoung-Jun Park, Witold Pedrycz, Sung-Kwun Oh |
Fuzzy polynomial neurons as neurofuzzy processing units. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. Appl. ![In: Neural Comput. Appl. 15(3-4), pp. 310-327, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Fuzzy polynomial neuron, Functional neuron, Neurofuzzy computing architecture, Universal approximator |
27 | Selçuk Baktir, Berk Sunar |
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 44st Annual Southeast Regional Conference, 2006, Melbourne, Florida, USA, March 10-12, 2006, pp. 549-554, 2006, ACM, 1-59593-315-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
fermat numbers, fermat transform, Fast Fourier Transform (FFT), finite fields, elliptic curve cryptography, coding theory, polynomial multiplication |
27 | Debojyoti Bhattacharya, Debdeep Mukhopadhyay, Dipanwita Roy Chowdhury |
A Cellular Automata Based Approach for Generation of Large Primitive Polynomial and Its Application to RS-Coded MPSK Modulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACRI ![In: Cellular Automata, 7th International Conference on Cellular Automata, for Research and Industry, ACRI 2006, Perpignan, France, September 20-23, 2006, Proceedings, pp. 204-214, 2006, Springer, 3-540-40929-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
MPSK Modulation, RS-encoding, Cellular Automata, Galois field, Primitive polynomial |
27 | David Castro 0007, Marc Giusti, Joos Heintz, Guillermo Matera, Luis Miguel Pardo |
The Hardness of Polynomial Equation Solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 3(4), pp. 347-420, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Polynomial equation solving, Continuous data structure, Holomorphic and continuous encoding, Complexity, Elimination theory |
27 | John H. Reif |
Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 29(3), pp. 487-510, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Nested Dissection, Parallel algorithms, Characteristic polynomial, Sparse linear systems |
27 | Satoru Iwata 0001, Lisa Fleischer, Satoru Fujishige |
A combinatorial strongly polynomial algorithm for minimizing submodular functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 48(4), pp. 761-777, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Discrete optimization, submodular function, strongly polynomial algorithm |
27 | Alexander A. Razborov |
Lower Bounds for the Polynomial Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 7(4), pp. 291-324, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
polynomial calculus, Proof complexity, pigeonhole principle |
27 | Peter Bürgisser, Martin Lotz |
The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 7(1), pp. 59-86, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 28003 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|