|
|
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 |
18 | Sung-Kwun Oh, In-Tae Lee, Hyun-Ki Kim |
Design of Fuzzy Set-Based Polynomial Neural Networks with the Aid of Symbolic Encoding and Information Granulation. |
International Conference on Computational Science (4) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Songxin Liang, David J. Jeffrey |
Unconstrained Parametric Minimization of a Polynomial: Approximate and Exact. |
ASCM |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Timo von Oertzen |
Exact Computation of Polynomial Zeros Expressible by Square Roots. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Anup Hosangadi, Farzan Fallah, Ryan Kastner |
Optimizing Polynomial Expressions by Algebraic Factorization and Common Subexpression Elimination. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Sung-Kwun Oh, Witold Pedrycz, Ho-Sung Park |
Genetically optimized fuzzy polynomial neural networks. |
IEEE Trans. Fuzzy Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Takayuki Gunji, Sunyoung Kim, Katsuki Fujisawa, Masakazu Kojima |
PHoMpara - Parallel Implementation of the Polyhedral Homotopy Continuation Method for Polynomial Systems. |
Computing |
2006 |
DBLP DOI BibTeX RDF |
homotopy continuation methods, polyhedral homotopy, parallel computation, Polynomials, software package, equations, numerical experiments |
18 | Parikshit Gopalan |
Query-efficient algorithms for polynomial interpolation over composites. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Michael Krivelevich, Dan Vilenchik |
Solving random satisfiable 3CNF formulas in expected polynomial time. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Xin Li 0009, Marc Moreno Maza |
Efficient Implementation of Polynomial Arithmetic in a Multiple-Level Programming Environment. |
ICMS |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Thao Dang 0001 |
Approximate Reachability Computation for Polynomial Systems. |
HSCC |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Szymon Jaroszewicz |
Polynomial association rules with applications to logistic regression. |
KDD |
2006 |
DBLP DOI BibTeX RDF |
association rules, continuous attributes |
18 | Vikraman Arvind, Piyush P. Kurur |
A Polynomial Time Nilpotence Test for Galois Groups and Related Results. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Harry Buhrman, Leen Torenvliet, Falk Unger |
Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
Selfreducibility, Computational Complexity, Sparseness |
18 | Zhiping Lin 0001, Mohamed S. Boudellioua, Li Xu 0004 |
On the equivalence and factorization of multivariate polynomial matrices. |
ISCAS |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Ho-Sung Park, Sung-Kwun Oh, Tae-Chon Ahn |
Optimization of Self-organizing Fuzzy Polynomial Neural Networks with the Aid of Granular Computing and Evolutionary Algorithm. |
IEA/AIE |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Masaaki Kanno, Hirokazu Anai, Kazuhiro Yokoyama |
On the Relationship Between the Sum of Roots with Positive Real Parts and Polynomial Spectral Factorization. |
Numerical Methods and Applications |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Arthur D. Chtcherba, Deepak Kapur |
Conditions for determinantal formula for resultant of a polynomial system. |
ISSAC |
2006 |
DBLP DOI BibTeX RDF |
Bézoutian, Dixon, dialytic, rank submatrix construction, resultant matrix, resultant |
18 | Marc Moreno Maza |
Triangular decompositions of polynomial systems: from theory to practice. |
ISSAC |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Ran Raz, Amir Shpilka |
Deterministic polynomial identity testing in non-commutative models. |
Comput. Complex. |
2005 |
DBLP DOI BibTeX RDF |
68Q25, Subject classification |
18 | Julia Böttcher |
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Ruben G. Lobo, Donald L. Bitzer, Mladen A. Vouk |
Locally Invertible Multivariate Polynomial Matrices. |
WCC |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Christophe Nègre |
Quadrinomial Modular Arithmetic using Modified Polynomial Basis. |
ITCC (1) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Degang Chen 0002, Qiang He, Xizhao Wang |
The Infinite Polynomial Kernel for Support Vector Machine. |
ADMA |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Marie Madeleine Derriennic |
Shape preserving polynomial curves. |
Adv. Comput. Math. |
2004 |
DBLP DOI BibTeX RDF |
preserving shape, blending system, totally positive system, Bézier-type curve, Bernstein-type polynomials, de la Vallée Poussin |
18 | Dariusz R. Kowalski, Andrzej Pelc |
Polynomial Deterministic Rendezvous in Arbitrary Graphs. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Mitsuo Wakatsuki, Kiyoshi Teraguchi, Etsuji Tomita |
Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data. |
ICGI |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Saso Dzeroski, Ljupco Todorovski, Peter Ljubic |
Inductive Databases of Polynomial Equations. |
DaWaK |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Ran Raz, Amir Shpilka |
Deterministic Polynomial Identity Testing in Non-Commutative Models. |
CCC |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Enric Rodríguez-Carbonell, Deepak Kapur |
Automatic generation of polynomial loop. |
ISSAC |
2004 |
DBLP DOI BibTeX RDF |
ideal, loop invariant, groebner basis |
18 | Daniel Augot, Matthieu Finiasz |
A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem. |
EUROCRYPT |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Minglu Jin, Sooyoung Kim Shin, Deockgil Oh, Jae Moung Kim |
Reduced order RLS polynomial predistortion. |
ISCAS (4) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Djordje Babic, Tapio Saramäki, Markku Renfors |
Prolonged transposed polynomial-based filters for decimation. |
ISCAS (4) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Ning Dong 0002, Jaijeet S. Roychowdhury |
Piecewise polynomial nonlinear model reduction. |
DAC |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Yongge Wang |
The algebraic structure of the isomorphic types of tally, polynomial time computable sets. |
Arch. Math. Log. |
2002 |
DBLP DOI BibTeX RDF |
|
18 | Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara |
Ordered Term Tree Languages which Are Polynomial Time Inductively Inferable from Positive Data. |
ALT |
2002 |
DBLP DOI BibTeX RDF |
|
18 | Yossi Azar, Oded Regev 0001 |
Strongly Polynomial Algorithms for the Unsplittable Flow Problem. |
IPCO |
2001 |
DBLP DOI BibTeX RDF |
|
18 | Valentina Marotta |
Resultants and Neighborhoods of a Polynomial. |
SNSC |
2001 |
DBLP DOI BibTeX RDF |
|
18 | Saed Samadi, Akinori Nishihara |
Response of maximally flat lowpass filters to polynomial signals. |
ISCAS (2) |
2001 |
DBLP DOI BibTeX RDF |
|
18 | Steven Fortune |
Polynomial root finding using iterated Eigenvalue computation. |
ISSAC |
2001 |
DBLP DOI BibTeX RDF |
|
18 | Nicolas T. Courtois, Alexander Klimov, Jacques Patarin, Adi Shamir |
Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations. |
EUROCRYPT |
2000 |
DBLP DOI BibTeX RDF |
|
18 | Ghislain Franssens |
A new non-polynomial univariate interpolation formula of Hermite type. |
Adv. Comput. Math. |
1999 |
DBLP DOI BibTeX RDF |
univariate Hermite interpolation, Multipoint Taylor series, 41A58, 26E05, 65D05, 65D15, 41A30 |
18 | Satrajit Gupta, Lalit M. Patnaik |
Exact Output Response Computation of RC Interconnects under Polynomial Input Waveforms. |
VLSI Design |
1999 |
DBLP DOI BibTeX RDF |
|
18 | Takashi Mihara, Shao Chin Sung |
A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem. |
ISAAC |
1998 |
DBLP DOI BibTeX RDF |
|
18 | Holger Petersen 0001 |
The Head Hierarchy for Oblivious Finite Automata with Polynomial Advice Collapses. |
MFCS |
1998 |
DBLP DOI BibTeX RDF |
|
18 | Victor Y. Pan |
An algebraic approach to approximate evaluation of a polynomial on a set of real points. |
Adv. Comput. Math. |
1995 |
DBLP DOI BibTeX RDF |
Subject classification 68Q25, 65D05, 65D15, 65Y20 |
18 | Marek Karpinski, Friedhelm Meyer auf der Heide |
On the Complexity of Genuinely Polynomial Computation. |
MFCS |
1990 |
DBLP DOI BibTeX RDF |
|
18 | Jan Chomicki |
Polynomial Time Query Processing in Temporal Deductive Databases. |
PODS |
1990 |
DBLP DOI BibTeX RDF |
|
18 | Birgit Jenner, Bernd Kirsig |
Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata. |
STACS |
1988 |
DBLP DOI BibTeX RDF |
|
18 | Steven Homer |
Minimal degrees for polynomial reducibilities. |
J. ACM |
1987 |
DBLP DOI BibTeX RDF |
|
18 | Ahlem Ben Cherifa, Pierre Lescanne |
An Actual Implementation of a Procedure That Mechanically Proves Termination of Rewriting Systems Based on Inequalities Between Polynomial Interpretations. |
CADE |
1986 |
DBLP DOI BibTeX RDF |
|
18 | Klaus Ambos-Spies |
On the Structure of Polynomial Time Degrees. |
STACS |
1984 |
DBLP DOI BibTeX RDF |
|
17 | Grzegorz Borowik, Andrzej Paszkiewicz |
Hardware Accelerator for Generating Primitive Polynomials over GF(3). |
ICSEng |
2011 |
DBLP DOI BibTeX RDF |
trinomial, stream cipher, linear feedback shift register, primitive polynomial, irreducible polynomial |
17 | Hamilton Emmons, Sanatan Rai |
Computational Complexity Theory. |
Encyclopedia of Optimization |
2009 |
DBLP DOI BibTeX RDF |
Recognition problem, Time complexity function, Nondeterministic polynomial algorithm, Computational complexity, Combinatorial optimization, Reducibility, NP-complete problem, Efficient algorithm, Complexity theory, NP-hard problem, Polynomial algorithm, Decision problem, Exponential algorithm |
17 | Stephen A. Vavasis |
Complexity Theory: Quadratic Programming. |
Encyclopedia of Optimization |
2009 |
DBLP DOI BibTeX RDF |
Trust region problem, Strongly polynomial time, Simplicial constraints, Box constraints, Ellipsoid method, Approximation algorithms, Complexity, NP-complete, NP-hard, Quadratic programming, Polynomial time, Knapsack problem, Interior point methods, Local minimization |
17 | Xiao-Shan Gao, Mingbo Zhang |
Decomposition of ordinary differential polynomials. |
Appl. Algebra Eng. Commun. Comput. |
2008 |
DBLP DOI BibTeX RDF |
Differential polynomial, Pseudo linear differential polynomial, Differential degree, Decomposition |
17 | QianQian Hu, GuoJin Wang |
A novel algorithm for explicit optimal multi-degree reduction of triangular surfaces. |
Sci. China Ser. F Inf. Sci. |
2008 |
DBLP DOI BibTeX RDF |
triangular Bézier surface, multi-degree reduction, Jacobi polynomial, L 2 norm, computer aided design, data compression, Bernstein polynomial |
17 | Robert W. Fitzgerald, Joseph L. Yucas |
Explicit Factorizations of Cyclotomic and Dickson Polynomials over Finite Fields. |
WAIFI |
2007 |
DBLP DOI BibTeX RDF |
Dickson polynomial, finite field, cyclotomic polynomial |
17 | Lih-Yuan Deng |
Efficient and portable multiple recursive generators of large order. |
ACM Trans. Model. Comput. Simul. |
2005 |
DBLP DOI BibTeX RDF |
DX-k generator, GMP, MRG, primitive polynomial, irreducible polynomial, linear congruential generator |
17 | Richard Cleve, John Watrous |
Fast parallel circuits for the quantum Fourier transform. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
fast parallel circuits, quantum Fourier transform, QFT, circuit depth, constant error, depth bound, polynomial size, classical polynomial-time processing, depth complexity, arbitrary modulus, lower bound, theorem proving, quantum computing, Fourier transforms, upper bound, circuit complexity, circuit complexity, quantum circuits, factoring algorithm |
17 | Maxim Sviridenko, Gerhard J. Woeginger |
Approximability and in-approximability results for no-wait shop scheduling. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
in-approximability results, no-wait shop scheduling, makespan criterion, computational complexity, approximability, processor scheduling, polynomial time approximation scheme, polynomial approximation, APX-hard |
17 | Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson |
Pseudorandom Generators in Propositional Proof Complexity. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
combinatorial pseudorandom generators, Nisan-Wigderson generator, Tseitin tautologies, polynomial calculus with resolution, polynomial calculus, computational complexity, theorem proving, process algebra, resolution, random processes, pseudorandom generators, propositional proof complexity |
17 | Huapeng Wu, M. Anwarul Hasan |
Low Complexity Bit-Parallel Multipliers for a Class of Finite Fields. |
IEEE Trans. Computers |
1998 |
DBLP DOI BibTeX RDF |
Galois or finite fields, equally spaced polynomial, dual basis, bit-parallel multiplier, all one polynomial |
17 | Giuseppa Carrà Ferro |
A Resultant Theory for the Systems of Two Ordinary Algebraic Differential Equations. |
Appl. Algebra Eng. Commun. Comput. |
1997 |
DBLP DOI BibTeX RDF |
Algebraic resultant, Differential resultant, Differential polynomial, Differential homogeneous polynomial |
17 | Kevin Cattell, Jon C. Muzio |
Partial Symmetry in Cellular Automata Rule Vectors. |
J. Electron. Test. |
1997 |
DBLP DOI BibTeX RDF |
palindrome, cellular automata, primitive polynomial, characteristic polynomial |
17 | Prasad Chalasani, Somesh Jha, Isaac Saias |
Approximate Option Pricing. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
approximate option pricing, world financial markets, binomial pricing model, stock price, path-dependent options, #-P hard, deterministic polynomial-time approximate algorithms, perpetual American put option, random walk, random walks, error analysis, Monte Carlo methods, Monte Carlo methods, polynomial time, error bounds, computational problem |
17 | William H. Cunningham, James F. Geelen |
The Optimal Path-Matching Problem. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
path-matching, weighted matroid intersection, optimization, generalization, polynomial-time algorithm, convex hull, matrix algebra, separation, equivalence, polynomial-time solvability |
17 | Grigory Kogan |
Computing Permanents over Fields of Characteristic 3: Where and Why It Becomes Difficult (extended abstract). |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
fields of characteristic 3, computational complexity, complexity, polynomial time algorithm, polynomial-time algorithm, matrix, permanents |
17 | Sanjeev Mahajan, Ramesh Hariharan |
Derandomizing Semidefinite Programming Based Approximation Algorithms. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
semidefinite programming based approximation algorithms, Max k-Cut, Max-Dicut, Max-Bisection, k Vertex Coloring, polynomial time randomized algorithms, polynomial time deterministic algorithms, computational complexity, randomized algorithms, semidefinite programming, programming theory, NP-Complete problems, deterministic algorithms, Independent Set, randomised algorithms, Max-Cut, Max-Sat |
17 | Guy Even, Joseph Naor, Satish Rao, Baruch Schieber |
Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
divide-and-conquer approximation algorithms, spreading metrics, NP-hard graph optimization problems, graph optimization problems, fractional spreading metric, fractional lengths, optimisation problem, spreading metric, interval graph completion, storage-time product, computational complexity, optimisation, directed graphs, directed graphs, polynomial time, vertices, divide and conquer methods, multicuts, polynomial time approximation algorithm |
17 | Martin Fürer |
Improved Hardness Results for Approximating the Chromatic Number. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
hardness results, chromatic number approximation, geometric proof, randomized twisting method, amortized free bits, polynomial lower bounds, computational complexity, graph theory, NP-hard, polynomial time algorithm, chromatic number |
17 | Aditi Dhagat, Lisa Hellerstein |
PAC Learning with Irrelevant Attributes |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
polynomial-time Occam algorithm, irrelevant attributes, Occam algorithm, decision lists, greedy set cover, polynomial-time, PAC learning |
17 | Foto N. Afrati, Christos H. Papadimitriou |
The Parallel Complexity of Simple Logic Programs. |
J. ACM |
1993 |
DBLP DOI BibTeX RDF |
polynomial fringe, polynomial stock, pushdown, automaton, P-completeness, NC |
17 | Sigal Ar, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan 0001 |
Reconstructing Algebraic Functions from Mixed Data |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
bivariate polynomial factorization, reconstructing algebraic functions, same points, self-correcting programs, machine learning, computer vision, curve fitting, black boxes, polynomial approximation, mixed data |
17 | Adi Shamir |
IP=PSPACE |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
acceptance probability, honest provers, public coins, logarithmic workspace, two-way access, random tape, interaction, IP, randomization, polynomial time, one-way functions, zero-knowledge proofs, interactive proofs, PSPACE, polynomial space, proof verification |
17 | László Babai, Lance Fortnow, Carsten Lund |
Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
efficient provability, multiple prover interactive proof systems, two-prover interactive protocols, noncommunicating provers, randomizing polynomial-time verifier, coNP-complete languages, nondeterministic exponential time, polynomial time |
17 | András Frank |
Augmenting Graphs to Meet Edge-Connectivity Requirements |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
node costs, minimum number, min-max formula, minimum-cost augmentation problem, edge costs, time complexity, polynomial-time algorithm, polynomial time, edge-connectivity |
17 | Seinosuke Toda |
On the Computational Power of PP and +P |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
two-sided bounded error probability, probabilistic Turing machine, (+)P, randomized polynomial-time reducibility, complexity classes, polynomial-time hierarchy, PH, PP |
17 | Takumi Kasai, Akeo Adachi, Shigeki Iwata |
Classes of pebble games and complete problems. |
ACM Annual Conference (2) |
1978 |
DBLP DOI BibTeX RDF |
Exponential time, Log-space, Two-person game, Winning strategy, Polynomial time, Turing machine, NP, Pebble game, Polynomial space |
17 | Albert Noltemeier |
Remark on algorithm 340 [C2]: roots of polynomials by a root-squaring and resultant routine. |
Commun. ACM |
1969 |
DBLP DOI BibTeX RDF |
Graeffe method, resultant procedure, root-squaring operations, rootfinders, roots of polynomial equations, subresultant procedure, testing of roots, polynomial zeros, acceptance criteria |
17 | Albert Noltemeier |
Algorithms: Algorithm 340: roots of polynomials by a root-squaring and resultant routine. |
Commun. ACM |
1968 |
DBLP DOI BibTeX RDF |
Graeffe method, resultant procedure, root-squaring operations, rootfinders, roots of polynomial equations, subresultant procedure, testing of roots, polynomial zeros, acceptance criteria |
17 | Maurice J. Jansen |
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials. |
CSR |
2009 |
DBLP DOI BibTeX RDF |
elementary symmetric polynomial, Computational complexity, determinant, arithmetical circuits, permanent |
17 | Lance Fortnow, Rahul Santhanam |
Infeasibility of instance compression and succinct PCPs for NP. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
instance compression, succinct PCPs, cryptography, parameterized complexity, polynomial hierarchy |
17 | Swastik Kopparty, Sergey Yekhanin |
Detecting Rational Points on Hypersurfaces over Finite Fields. |
CCC |
2008 |
DBLP DOI BibTeX RDF |
Chevalley-Warning Theorem, Lang-Weil Theorem, Nonsingular Spaces of Matrices, Polynomial Identity Testing |
17 | Rida T. Farouki, Chang Yong Han |
Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems. |
Appl. Algebra Eng. Commun. Comput. |
2007 |
DBLP DOI BibTeX RDF |
Root neighborhoods, Pseudozero sets, Spectral sets, Generalized lemniscate, Kharitonov theorem, Robust stability, Polynomial roots |
17 | Adam R. Klivans, Alexander A. Sherstov |
Unconditional lower bounds for learning intersections of halfspaces. |
Mach. Learn. |
2007 |
DBLP DOI BibTeX RDF |
Intersections of halfspaces, Halfspace learning, SQ learning, Lower bounds for learning, Harmonic sieve, PAC learning, Query learning, Statistical queries, Polynomial threshold functions |
17 | David Doty, Philippe Moser |
Feasible Depth. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
randomness, polynomial-time, dimension, depth, finite-state |
17 | Anton Leykin, Frank Sottile |
Computing monodromy via parallel homotopy continuation. |
PASCO |
2007 |
DBLP DOI BibTeX RDF |
Schubert problems, polynomial homotopy continuation monodromy, parallel processing, distributed computing, Galois group |
17 | Alexander B. Levin |
Gröbner bases with respect to several term orderings and multivariate dimension polynomials. |
ISSAC |
2007 |
DBLP DOI BibTeX RDF |
Gröbner basis, differential field extension, dimension polynomial, ore polynomials, p-dimensional ltration |
17 | Elena S. Dimitrova, Abdul Salam Jarrah, Reinhard C. Laubenbacher, Brandilyn Stigler |
A Gröbner fan method for biochemical network modeling. |
ISSAC |
2007 |
DBLP DOI BibTeX RDF |
gröbner bases, gröbner fan, monomial orderings, polynomial dynamical systems, reverse engineering, model selection, computational algebra, network inference |
17 | Chengjun Liu |
Capitalize on Dimensionality Increasing Techniques for Improving Face Recognition Grand Challenge Performance. |
IEEE Trans. Pattern Anal. Mach. Intell. |
2006 |
DBLP DOI BibTeX RDF |
Dimensionality increasing techniques, Face Recognition Grand Challenge (FRGC), fractional power polynomial models, Gabor image representation, Kernel Fisher Analysis (KFA) method, face recognition |
17 | Jan Verschelde, Yan Zhuang |
Parallel Implementation of the Polyhedral Homotopy Method. |
ICPP Workshops |
2006 |
DBLP DOI BibTeX RDF |
polyhedral homotopies, load balancing, parallel computation, polynomial systems, path following, Continuation methods |
17 | Alin Bostan, Frédéric Chyzak, Bruno Salvy, Thomas Cluzeau |
Low complexity algorithms for linear recurrences. |
ISSAC |
2006 |
DBLP DOI BibTeX RDF |
creative telescoping, polynomial and rational solutions, summation, complexity, computer algebra, linear recurrences |
17 | Berk Sunar |
An Efficient Basis Conversion Algorithm for Composite Fields with Given Representations. |
IEEE Trans. Computers |
2005 |
DBLP DOI BibTeX RDF |
change of basis, Finite fields, polynomial factorization, composite fields |
17 | Naoki Sawada, Yasuto Suzuki, Keiichi Kaneko |
Container Problem in Burnt Pancake Graphs. |
ISPA |
2005 |
DBLP DOI BibTeX RDF |
burnt pancake graphs, container problem, internally disjoint paths, polynomial time algorithm |
17 | Siming Huang |
Inverse Problems of Some NP-Complete Problems. |
AAIM |
2005 |
DBLP DOI BibTeX RDF |
pseudo-polynomial algorithm, integer programming, Inverse problem, Knapsack problem |
17 | Gabriela Jeronimo, Teresa Krick, Juan Sabia, Martín Sombra |
The Computational Complexity of the Chow Form. |
Found. Comput. Math. |
2004 |
DBLP DOI BibTeX RDF |
Chow form, Equidimensional decomposition of algebraic varieties, Symbolic Newton algorithm, Sparse resultant, Overdetermined polynomial equation system |
17 | Oliver Kullmann |
Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems. |
Ann. Math. Artif. Intell. |
2004 |
DBLP DOI BibTeX RDF |
satisfiability problem (SAT), systems with partial instantiation, generalised resolution, lower bounds for resolution, upper bounds for SAT algorithms, automatisation of proof systems, generalised input resolution, generalised width restricted resolution, induced width of constraint satisfaction problems, constraint satisfaction problems, propositional logic, polynomial time hierarchies |
17 | Oleg Davydov, Frank Zeilfelder |
Scattered Data Fitting by Direct Extension of Local Polynomials to Bivariate Splines. |
Adv. Comput. Math. |
2004 |
DBLP DOI BibTeX RDF |
four-directional mesh, local polynomial least squares approximation, Bernstein-Bézier techniques, minimal determining set, scattered data fitting, bivariate splines |
17 | Yasuyuki Nogami, Yoshitaka Morikawa |
A Method for Distinguishing the Two Candidate Elliptic Curves in CM Method. |
ICISC |
2004 |
DBLP DOI BibTeX RDF |
CM method, irreducible cubic polynomial, quadratic power residue/non residue |
17 | Leonid Libkin |
Variable independence for first-order definable constraints. |
ACM Trans. Comput. Log. |
2003 |
DBLP DOI BibTeX RDF |
definable sets, polynomial constraints, variable independence, First-order logic, spatio-temporal databases, linear constraints |
Displaying result #401 - #500 of 28003 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ >>] |
|