|
|
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 |
15 | Amin Coja-Oghlan |
Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, pp. 201-211, 2002, Springer, 3-540-44040-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Ali Dasdan |
A strongly polynomial-time algorithm for over-constraint resolution: efficient debugging of timing constraint violations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CODES ![In: Proceedings of the Tenth International Symposium on Hardware/Software Codesign, CODES 2002, Estes Park, Colorado, USA, May 6-8, 2002, pp. 127-132, 2002, ACM, 1-58113-542-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
scheduling, high-level synthesis, constraint satisfaction, timing constraints, behavioral synthesis, rate analysis |
15 | Markus Müller-Olm, Helmut Seidl |
Polynomial Constants Are Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 9th International Symposium, SAS 2002, Madrid, Spain, September 17-20, 2002, Proceedings, pp. 4-19, 2002, Springer, 3-540-44235-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Mary Cryan, Martin E. Dyer |
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. ![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. 240-249, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Eugene M. Luks, Takunari Miyazaki |
Polynomial-time normalizers for permutation groups with restricted composition factors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2002, Lille, France, July 7-10, 2002, Proceedings, pp. 176-183, 2002, ACM, 1-58113-484-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara |
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables. ![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. 335-346, 2001, Springer, 3-540-42487-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Grace W. Rumantir, Chris S. Wallace |
Sampling of Highly Correlated Data for Polynomial Regression and Model Discovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IDA ![In: Advances in Intelligent Data Analysis, 4th International Conference, IDA 2001, Cascais, Portugal, September 13-15, 2001, Proceedings, pp. 370-377, 2001, Springer, 3-540-42581-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel |
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, pp. 365-375, 2001, Springer, 3-540-41695-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Robert Seater, David Wonnacott |
Polynomial Time Array Dataflow Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCPC ![In: Languages and Compilers for Parallel Computing, 14th International Workshop, LCPC 2001, Cumberland Falls, KY, USA, August 1-3, 2001. Revised Papers, pp. 411-426, 2001, Springer, 3-540-04029-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Zhiping Lin 0001, Jiang Qian Ying, Li Xu 0004 |
Further results on primitive factorizations for nD polynomial matrices. ![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. 373-376, 2001, IEEE, 0-7803-6685-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Fabrice Monteiro, Abbas Dandache, Bernard Lepley |
Fast Configurable Polynomial Division for Error Control Coding Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IOLTW ![In: 7th IEEE International On-Line Testing Workshop (IOLTW 2001), 9-11 July 2001, Taormina, Italy, pp. 158-, 2001, IEEE Computer Society, 0-7695-1290-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Thomas Malzbender, Dan Gelb, Hans J. Wolters |
Polynomial texture maps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGGRAPH ![In: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 2001, Los Angeles, California, USA, August 12-17, 2001, pp. 519-528, 2001, ACM, 1-58113-374-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
image processing, image-based rendering, texture mapping, graphics hardware, illumination, reflectance & shading models |
15 | Evangelos Dermatas |
Direct Estimation of Polynomial Densities in Generalized RBF Networks Using Moments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICANN ![In: Artificial Neural Networks - ICANN 2001, International Conference Vienna, Austria, August 21-25, 2001 Proceedings, pp. 119-126, 2001, Springer, 3-540-42486-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Alexandre Sedoglavic |
A probabilistic algorithm to test local algebraic observability in polynomial time. ![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. 309-317, 2001, ACM, 1-58113-417-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
seminumerical algorithm, observability, identifiability |
15 | Nathan Linial, Alex Samorodnitsky, Avi Wigderson |
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 20(4), pp. 545-568, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 90C27, 15A15, 15A12, 65B99, 90C30 |
15 | Victor Y. Pan |
Matrix structure, polynomial arithmetic, and erasure-resilient encoding/decoding. ![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. 266-271, 2000, ACM, 1-58113-218-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Dengwei Fu, Alan N. Willson Jr. |
Design of an improved interpolation filter using a trigonometric polynomial. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (4) ![In: Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30 - June 2, 1999, pp. 363-366, 1999, IEEE, 0-7803-5471-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
15 | Ravi Kumar 0001, D. Sivakumar 0001 |
Proofs, Codes, and Polynomial-Time Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999, pp. 46-53, 1999, IEEE Computer Society, 0-7695-0075-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
reducibilities, proof systems, partial solutions |
15 | Sanjeev Arora |
Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 45(5), pp. 753-782, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
approximation algorithms, matching, traveling salesman problem, network design, Steiner problem |
15 | Mikkel Thorup |
Map Graphs in Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 396-405, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
15 | Javier Sánchez-Reyes |
The Symmetric Analogue of the Polynomial Power Basis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 16(3), pp. 319-357, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Ball basis, Bernstein-Be´zier basis, monomial form, power basis, symmetric power, Hermite interpolation, degree reduction |
15 | Gilles Brassard, Peter Høyer |
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISTCS ![In: Fifth Israel Symposium on Theory of Computing and Systems, ISTCS 1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings, pp. 12-23, 1997, IEEE Computer Society, 0-8186-8037-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
15 | John Harrison 0001 |
Verifying the Accuracy of Polynomial Approximations in HOL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TPHOLs ![In: Theorem Proving in Higher Order Logics, 10th International Conference, TPHOLs'97, Murray Hill, NJ, USA, August 19-22, 1997, Proceedings, pp. 137-152, 1997, Springer, 3-540-63379-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
15 | Jerzy Tyszkiewicz |
Queries and Algorithms Computable by Polynomial Time Existential Reflective Machines (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings, pp. 498-507, 1997, Springer, 3-540-63437-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
15 | Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer 0001 |
Hyper-Polynomial Hierarchies and the NP-Jump. ![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. 102-110, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
15 | Klaus Ambos-Spies |
On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 22nd International Colloquium, ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings, pp. 384-392, 1995, Springer, 3-540-60084-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Marc Giusti, Joos Heintz, Jose Enrique Morais, Luis Miguel Pardo |
When Polynomial Equation Systems Can Be "Solved" Fast?. ![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. 205-231, 1995, Springer, 3-540-60114-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Jürgen Giesl |
Generating Polynomial Orderings for Termination Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 6th International Conference, RTA-95, Kaiserslautern, Germany, April 5-7, 1995, Proceedings, pp. 426-431, 1995, Springer, 3-540-59200-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Dinesh Manocha |
Computing Selected Solutions of Polynomial Equations. ![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. 1-8, 1994, ACM, 0-89791-638-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
15 | David A. Plaisted |
Polynomial Time Termination and Constraint Satisfaction Tests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 5th International Conference, RTA-93, Montreal, Canada, June 16-18, 1993, Proceedings, pp. 405-420, 1993, Springer, 3-540-56868-9. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
15 | Ketan Mulmuley |
A lOwer Bound for Solvability of Polynomial Equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 13th Conference, Bombay, India, December 15-17, 1993, Proceedings, pp. 268-283, 1993, Springer, 3-540-57529-4. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
15 | Victor Y. Pan |
New Resultant Inequalities and Complex Polynomial Factorization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISTCS ![In: Theory of Computing and Systems, ISTCS'92, Israel Symposium, Haifa, Israel, May 1992, pp. 122-136, 1992, Springer, 3-540-55553-6. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
15 | László Babai |
Deciding Finiteness of Matrix Groups in Las Vegas Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, USA., pp. 33-40, 1992, ACM/SIAM, 0-89791-466-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
15 | Adam Cichon, Pierre Lescanne |
Polynomial Interpretations and the Complexity of Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-11, 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 15-18, 1992, Proceedings, pp. 139-147, 1992, Springer, 3-540-55602-8. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
15 | Michael Kalkbrener |
Solving Systems of Bivariate Algebraic Equations by Using Primitive Polynomial Remainder Sequences. ![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. 295, 1990, ACM, 0-201-54892-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
15 | Dieter Spreen |
On Functions Computable in Nondeterministic Polynomial Time: Some Characterizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: CSL '87, 1st Workshop on Computer Science Logic, Karlsruhe, Germany, October 12-16, 1987, Proceedings, pp. 289-303, 1987, Springer, 3-540-50241-6. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
15 | José L. Balcázar, Ronald V. Book, Uwe Schöning |
The polynomial-time hierarchy and sparse oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 33(3), pp. 603-617, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
15 | Guy Viry |
Polynomial Factorization over Z[x]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Algebraic Algorithms and Error-Correcting Codes, 3rd International Conference, AAECC-3, Grenoble, France, July 15-19, 1985, Proceedings, pp. 326-332, 1985, Springer, 3-540-16776-5. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
15 | Alan L. Selman |
P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 6th Colloquium, Graz, Austria, July 16-20, 1979, Proceedings, pp. 546-555, 1979, Springer, 3-540-09510-1. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
|
15 | Shimon Even, Robert Endre Tarjan |
A Combinatorial Problem Which Is Complete in Polynomial Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 23(4), pp. 710-719, 1976. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
|
14 | Willem Jan van Hoeve, Gilles Pesant, Louis-Martin Rousseau, Ashish Sabharwal |
New filtering algorithms for combinations of among constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 14(2), pp. 273-292, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Domain consistency, Polynomial time filtering, Car sequencing, Regular constraint, Sequence constraint |
14 | Huaping Chen 0002, Mingwang Zhang, Yuqin Zhao |
A Class of New Large-Update Primal-Dual Interior-Point Algorithms for Linear Complementarity Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (3) ![In: Advances in Neural Networks - ISNN 2009, 6th International Symposium on Neural Networks, ISNN 2009, Wuhan, China, May 26-29, 2009, Proceedings, Part III, pp. 77-87, 2009, Springer, 978-3-642-01512-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Large-update method, P ???(?) LCPs, Finite kernel function, Interior-point algorithm, Polynomial complexity |
14 | Foto N. Afrati, Phokion G. Kolaitis |
Repair checking in inconsistent databases: algorithms and complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT 2009, 12th International Conference, St. Petersburg, Russia, March 23-25, 2009, Proceedings, pp. 31-41, 2009, ACM, 978-1-60558-423-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
coNP-complete problem, equality-generating dependencies, repair checking, tuple-generating dependencies, weakly acyclic set, polynomial time, consistent query answering, inconsistent databases, database repairs |
14 | Noraliza Hamzah, Hanim Ismail, Zuhaina Zakaria |
The Application of Support Vector Machine in Classifying the Causes of Voltage Sag in Power System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSKT ![In: Rough Sets and Knowledge Technology, 4th International Conference, RSKT 2009, Gold Coast, Australia, July 14-16, 2009. Proceedings, pp. 421-428, 2009, Springer, 978-3-642-02961-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
voltage sag, support vector machine, radial basis function, polynomial, Power quality |
14 | Yusuke Tanahashi, Ryohei Nakano |
Bidirectional Clustering of MLP Weights for Finding Nominally Conditioned Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICANN (2) ![In: Artificial Neural Networks - ICANN 2009, 19th International Conference, Limassol, Cyprus, September 14-17, 2009, Proceedings, Part II, pp. 155-164, 2009, Springer, 978-3-642-04276-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
weight sharing, information criteria, rule extraction, multi-layer perceptron, polynomial regression |
14 | Alin Bostan, Éric Schost |
Fast algorithms for differential equations in positive characteristic. ![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. 47-54, 2009, ACM, 978-1-60558-609-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
p-curvature, algorithms, complexity, differential equations, polynomial solutions |
14 | Shuji Kijima, Tomomi Matsui |
Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 162(1), pp. 35-55, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Fully polynomial-time randomized approximation scheme, Queueing network, Markov chain Monte Carlo, Perfect simulation, Product form solution |
14 | Hadas Shachnai, Tami Tamir, Omer Yehezkely |
Approximation Schemes for Packing with Item Fragmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 43(1), pp. 81-98, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Item fragmentation, Algorithms, Linear programming, Bin packing, Polynomial time approximation schemes |
14 | Dan Trietsch, Kenneth R. Baker |
Minimizing the number of tardy jobs with stochastically-ordered processing times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 11(1), pp. 71-73, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Sequencing, Polynomial algorithm, Stochastic scheduling |
14 | Tobias Preusser, Hanno Scharr, Kai Krajsek, Robert M. Kirby |
Building Blocks for Computer Vision with Stochastic Partial Differential Equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. ![In: Int. J. Comput. Vis. 80(3), pp. 375-405, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Stochastic partial differential equations, Stochastic Galerkin method, Stochastic finite element method, Image processing, Error propagation, Random fields, Polynomial chaos |
14 | Yun Guan, Jan Verschelde |
Parallel Implementation of a Subsystem-by-Subsystem Solver. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCS ![In: 22nd Annual International Symposium on High Performance Computing Systems and Applications (HPCS 2008), June 9-11, 2008, Québec City, Canada, pp. 117-123, 2008, IEEE Computer Society, 978-0-7695-3250-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
subsystem-by-subsystem solver, polynomial systems, homotopy continuation |
14 | Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca |
A logical account of pspace. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, January 7-12, 2008, pp. 121-131, 2008, ACM, 978-1-59593-689-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
type assignment, linear logic, implicit computational complexity, polynomial space |
14 | Haining Fan, M. Anwar Hasan |
A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 56(2), pp. 224-233, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
subquadratic space complexity multiplier, shifted polynomial basis, Finite field, coordinate transformation, Toeplitz matrix |
14 | Robert M. Corless, Nargol Rezvani, Amirhossein Amiraslani |
Pseudospectra of Matrix Polynomials that Are Expressed in Alternative Bases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 1(2), pp. 353-374, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Pseudospectra, matrix polynomial, Lebesgue functions, Lebesgue constants, conditioning |
14 | Jean-Philippe Aumasson, Matthieu Finiasz, Willi Meier, Serge Vaudenay |
TCHo: A Hardware-Oriented Trapdoor Cipher. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACISP ![In: Information Security and Privacy, 12th Australasian Conference, ACISP 2007, Townsville, Australia, July 2-4, 2007, Proceedings, pp. 184-199, 2007, Springer, 978-3-540-73457-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
hardware, linear feedback shift register, public-key cryptosystem, polynomial multiples, post-quantum cryptography |
14 | Brian F. Redmond |
Multiplexor Categories and Models of Soft Linear Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LFCS ![In: Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings, pp. 472-485, 2007, Springer, 978-3-540-72732-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Categorical semantics, Soft Linear Logic, Polynomial time, Game semantics |
14 | Wenqi Zhao, Guoliang Xu, Chandrajit L. Bajaj |
An algebraic spline model of molecular surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symposium on Solid and Physical Modeling ![In: Proceedings of the 2007 ACM Symposium on Solid and Physical Modeling, Beijing, China, June 4-6, 2007, pp. 297-302, 2007, ACM, 978-1-59593-666-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Bernstein-Bezier basis, energetics, polynomial splines, prismatic scaffolds, solvation, error bounds, rate of convergence, molecular surfaces |
14 | Erich L. Kaltofen, Zhengfeng Yang, Lihong Zhi |
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms. ![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. 11-17, 2007, ACM, 978-1-59593-744-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
multivariate rational function, random matrix, structured matrix, interpolation, probabilistic analysis, condition number, sparse polynomial, symbolic/numeric hybrid method |
14 | Barry H. Dayton |
Numerical local rings and local solution of nonlinear systems. ![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. 79-86, 2007, ACM, 978-1-59593-744-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
analytic system, local ring, reduced row echelon form, polynomial system |
14 | Martin E. Avendano, Teresa Krick, Ariel Pacetti |
Newton-Hensel Interpolation Lifting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 6(1), pp. 82-120, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Newton-Hensel lifting, Adic integers, Sparse polynomial interpolation |
14 | Salvador Lucas |
On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 17(1), pp. 49-73, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Polynomial orderings, Program analysis, Termination, Term rewriting |
14 | Sergei Chubanov, Mikhail Y. Kovalyov, Erwin Pesch |
An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 106(3), pp. 453-466, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Capacitated economic lot-sizing problem, Dynamic programming, Fully polynomial time approximation scheme |
14 | Thang V. Pham, Arnold W. M. Smeulders |
Sparse Representation for Coarse and Fine Object Recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 28(4), pp. 555-567, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
PCA, B-spline, multiscale, sparse representation, polynomial approximation, matching pursuit, Gaussian derivatives |
14 | Xiaoliang Wan, George E. Karniadakis |
Beyond Wiener-Askey Expansions: Handling Arbitrary PDFs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sci. Comput. ![In: J. Sci. Comput. 27(1-3), pp. 455-464, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Uncertainty, stochastic differential equation, polynomial chaos |
14 | Fatima Abu Salem |
A New Sparse Gaussian Elimination Algorithm and the Niederreiter Linear System for Trinomials over F2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 77(2), pp. 179-203, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Niederreiter algorithm, Finite fields, polynomial factorization, sparse Gaussian elimination |
14 | Sylvie Boldo, César A. Muñoz |
Provably faithful evaluation of polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), Dijon, France, April 23-27, 2006, pp. 1328-1332, 2006, ACM, 1-59593-108-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
formal verification, floating-point, polynomial evaluation |
14 | Rainer Göttfert |
Sequences of Period 2N-2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SETA ![In: Sequences and Their Applications - SETA 2006, 4th International Conference, Beijing, China, September 24-28, 2006, Proceedings, pp. 223-236, 2006, Springer, 3-540-44523-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Periodic sequences, nonlinear feedback shift registers, minimal polynomial |
14 | Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz |
How to Sell a Graph: Guidelines for Graph Retailers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers, pp. 125-136, 2006, Springer, 3-540-48381-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Pricing problems, tollbooth problem, highway problem, computational complexity, dynamic programming, fully polynomial time approximation scheme |
14 | Yassir Nawaz, Guang Gong, Kishan Chand Gupta |
Upper Bounds on Algebraic Immunity of Boolean Power Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSE ![In: Fast Software Encryption, 13th International Workshop, FSE 2006, Graz, Austria, March 15-17, 2006, Revised Selected Papers, pp. 375-389, 2006, Springer, 3-540-36597-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Inverse exponent, Kasami exponent, Niho exponent, Algebraic attacks, Algebraic immunity, Power functions, Polynomial functions |
14 | Jiejun Kong, Xiaoyan Hong, Mario Gerla |
Modeling Ad-hoc rushing attack in a negligibility-based security framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Wireless Security ![In: Proceedings of the 2006 ACM Workshop on Wireless Security, Los Angeles, California, USA, September 29, 2006, pp. 55-64, 2006, ACM, 1-59593-557-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
asymptotic invariant, neg-ligibility, randomized network algorithms, randomized turing machine, sub-polynomial, scalability |
14 | Jianqin Zhou, Qiang Zheng |
A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over GF(3). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CANS ![In: Cryptology and Network Security, 5th International Conference, CANS 2006, Suzhou, China, December 8-10, 2006, Proceedings, pp. 213-223, 2006, Springer, 3-540-49462-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Cryptography, linear complexity, periodic sequence, minimal polynomial |
14 | José-Alejandro Piñeiro, Stuart F. Oberman, Jean-Michel Muller, Javier D. Bruguera |
High-Speed Function Approximation Using a Minimax Quadratic Interpolator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 54(3), pp. 304-318, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Table-based methods, minimax polynomial approximation, single-precision computations, computer arithmetic, square root, reciprocal, elementary functions |
14 | Shao Chin Sung, Milan Vlach |
Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 8(5), pp. 453-460, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
just-in-time jobs, unrelated parallel machines, NP-hardness, polynomial time algorithm |
14 | Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang 0004, D. T. Lee |
Two Variations of the Minimum Steiner Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 9(1), pp. 101-120, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
minimum Steiner network, minimum union paths, NP-hard, directed acyclic graph, polynomial time |
14 | Liying Kang, T. C. Edwin Cheng, C. T. Ng 0001, Min Zhao |
Scheduling to Minimize Makespan with Time-Dependent Processing Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 925-933, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
fully polynomial approximation scheme, makespan, parallel machines scheduling |
14 | Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara |
Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. ![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. 433-444, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
# P-completeness, NP-completeness, polynomial time algorithm, enumeration, independent set, Chordal graph, counting |
14 | Marie-Christine Costa, Fethi Jarray, Christophe Picouleau |
Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Theoretical Computer Science, 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings, pp. 173-181, 2005, Springer, 3-540-29106-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
alternate periodicity, polynomial time algorithm, discrete tomography, binary matrix |
14 | Antoine Joux, Sébastien Kunz-Jacques, Frédéric Muller, Pierre-Michel Ricordel |
Cryptanalysis of the Tractable Rational Map Cryptosystem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Public Key Cryptography ![In: Public Key Cryptography - PKC 2005, 8th International Workshop on Theory and Practice in Public Key Cryptography, Les Diablerets, Switzerland, January 23-26, 2005, Proceedings, pp. 258-274, 2005, Springer, 3-540-24454-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Tractable Rational Map Cryptosystem, XL, Gröbner Bases, Isomorphism of Polynomials, Public Key Cryptography, Polynomial Systems |
14 | 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 |
14 | Mikhail Ju. Moshkov |
On Construction of the Set of Irreducible Partial Covers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGA ![In: Stochastic Algorithms: Foundations and Applications, Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005, Proceedings, pp. 38-44, 2005, Springer, 3-540-29498-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Irreducible partial cover, totally polynomial algorithm |
14 | Berk Sunar, David Cyganski |
Comparison of Bit and Word Level Algorithms for Evaluating Unstructured Functions over Finite Rings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHES ![In: Cryptographic Hardware and Embedded Systems - CHES 2005, 7th International Workshop, Edinburgh, UK, August 29 - September 1, 2005, Proceedings, pp. 237-249, 2005, Springer, 3-540-28474-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Horner’s method, word level, finite fields, multivariate polynomials, polynomial evaluation |
14 | Bok-Min Goi, Jintai Ding, Mohammad Umar Siddiqi |
Cryptanalysis of PASS II and MiniPass. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICICS ![In: Information and Communications Security, 7th International Conference, ICICS 2005, Beijing, China, December 10-13, 2005, Proceedings, pp. 159-168, 2005, Springer, 3-540-30934-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
partial polynomial evaluation, cryptanalysis, digital signature scheme, NTRU, Authentication scheme |
14 | Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson |
Adversarial contention resolution for simple channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA, pp. 325-332, 2005, ACM, 1-58113-986-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
exponential backoff, polynomial backoff, worst-case backoff performance, on-line, batch |
14 | Alan G. B. Lauder |
Counting Solutions to Equations in Many Variables over Finite Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 4(3), pp. 221-267, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Homogeneous polynomial, Projective hypersurface, Dwork cohomology, Deformation theory, p-adic differentail equation, Algorithm, Finite field, Zeta function |
14 | Sunyoung Kim, Masakazu Kojima |
Numerical Stability of Path Tracing in Polyhedral Homotopy Continuation Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 73(4), pp. 329-348, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
polyhedral homotopy continuation methods, numerical stability, Polynomial system, path tracing |
14 | Xiaorong Hou, Xuemin Wang |
A Generalization of Xie-Nie Stability Criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWMM/GIAE ![In: Computer Algebra and Geometric Algebra with Applications, 6th International Workshop, IWMM 2004, Shanghai, China, May 19-21, 2004, and International Workshop, GIAE 2004, Xian, China, May 24-28, 2004, Revised Selected Papers, pp. 65-71, 2004, Springer, 3-540-26296-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Hurwitzean polynomial, stability criterion |
14 | Markus Müller-Olm, Helmut Seidl |
Precise interprocedural analysis through linear algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2004, Venice, Italy, January 14-16, 2004, pp. 330-341, 2004, ACM, 1-58113-729-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
affine relation, polynomial relation, linear algebra, interprocedural analysis, weakest precondition |
14 | Xiaotie Deng, Guojun Li |
A PTAS for Embedding Hypergraph in a Cycle (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 433-444, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Minimum congestion embedding hypergraph in a cycle, polynomial-time approximation scheme, computer application |
14 | Jun Li 0005, Wei-Yun Yau |
Prediction of Fingerprint Orientation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR (4) ![In: 17th International Conference on Pattern Recognition, ICPR 2004, Cambridge, UK, August 23-26, 2004., pp. 436-439, 2004, IEEE Computer Society, 0-7695-2128-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
orientation prediction, fingerprint orientation, polynomial model, phase portrait model |
14 | Gwénolé Ars, Jean-Charles Faugère, Hideki Imai, Mitsuru Kawazoe, Makoto Sugita |
Comparison Between XL and Gröbner Basis Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2004, 10th International Conference on the Theory and Application of Cryptology and Information Security, Jeju Island, Korea, December 5-9, 2004, Proceedings, pp. 338-353, 2004, Springer, 3-540-23975-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Multivariate polynomial equations, Solving Systems, Gröbner basis, Semi-regular Sequences, Algebraic attacks, XL algorithm |
14 | Pavel Zahradnik, Miroslav Vlcek |
Fast Design of 2-D Narrow Bandstop FIR Filters for Image Enhancement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES ![In: Knowledge-Based Intelligent Information and Engineering Systems, 8th International Conference, KES 2004, Wellington, New Zealand, September 20-25, 2004. Proceedings. Part III, pp. 726-732, 2004, Springer, 3-540-23205-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
bandstop filter, Zolotarev polynomial, equiripple approximation, FIR filter, two-dimensional |
14 | Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong |
A Linear Systolic Array for Multiplication in GF(2m) for High Speed Cryptographic Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (4) ![In: Computational Science and Its Applications - ICCSA 2004, International Conference, Assisi, Italy, May 14-17, 2004, Proceedings, Part IV, pp. 106-116, 2004, Springer, 3-540-22060-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Riemann Hypothesis, Artins conjecture for primitive roots, systolic array, Finite field multiplier, all one polynomial |
14 | Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang |
Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2004, International Conference, Assisi, Italy, May 14-17, 2004, Proceedings, Part III, pp. 355-366, 2004, Springer, 3-540-22057-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
approximation algorithm, spanning tree, polynomial time approximation scheme, Combinatorial optimization problem |
14 | Evelyne Hubert |
Improvements to a triangulation-decomposition algorithm for ordinary differential systems in higher degree cases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2004, Santander, Spain, July 4-7, 2004, Proceedings, pp. 191-198, 2004, ACM, 1-58113-827-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
differential elimination, differential ideal theory, subresultant polynomial remainder sequence, systems of differential equations, triangular sets |
14 | Shuhong Gao, Erich L. Kaltofen, John P. May, Zhengfeng Yang, Lihong Zhi |
Approximate factorization of multivariate polynomials via differential equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2004, Santander, Spain, July 4-7, 2004, Proceedings, pp. 167-174, 2004, ACM, 1-58113-827-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
approximate gcd, multivariate gcd, multivariate polynomial factorization, symbolic numeric hybrid method, singular value decomposition, approximate factorization |
14 | Jan Verschelde |
Numerical algebraic geometry and symbolic computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2004, Santander, Spain, July 4-7, 2004, Proceedings, pp. 3, 2004, ACM, 1-58113-827-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
irreducible decomposition, numerical homotopy continuation, polynomial systems, approximate factorization |
14 | Didier Henrion, Jean B. Lasserre |
GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 29(2), pp. 165-194, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
SeDuMi, semidefinite programming, Matlab, linear matrix inequality, Polynomial programming |
14 | Daniel Kobler, Udi Rotics |
Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 37(4), pp. 327-346, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Induced matching, Bull, Polynomial algorithms, Regular graphs, Line-graphs, Claw-free graphs |
14 | Antonia W. Bluher |
On x6 + x + a in Characteristic Three. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 30(1), pp. 85-95, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
projective polynomial, accidental isomorphism, splitting field, Galois group, difference set |
14 | Soonhak Kwon, Heuisu Ryu |
Efficient Bit Serial Multiplication in GF(2m) for a Class of Finite Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICOIN ![In: Information Networking, Networking Technologies for Enhanced Internet Services International Conference, ICOIN 2003, Cheju Island, Korea, February 12-14, 2003, Revised Selected Papers, pp. 762-771, 2003, Springer, 3-540-40827-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
bit serial multiplication, optimal normal basis of type II, Finite field, dual basis, all one polynomial |
|
|