Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
polynomial method
Description:
The polynomial method is an algebraic technique that uses polynomial identities and bounds to prove results in combinatorics, geometry, and related fields.
Related topics:
Advanced Combinatorial Mathematics (10%),
Limits and Structures in Graph Theory (10%),
Advanced Control Systems Design (9%),
Quantum Computing Algorithms and Architecture (8%)
OpenAlex ID:
keywords/polynomial-method
Quantum lower bounds by polynomials
2001
·
Robert Beals
, Harry Buhrman
, et al.
·
Journal of the ACM
·
922
PDF
Polynomial calculation of the Shapley value based on sampling
2008
·
Javier Castro
, Daniel Gómez
, et al.
·
Computers & Operations Research
·
680
Combinatorial Nullstellensatz
1999
·
NOGA ALON
·
Combinatorics Probability Computing
·
653
Extremal Combinatorics: With Applications in Computer Science
2011
·
Stasys Jukna
·
Texts in theoretical computer science
·
396
Handbook of Time Series Analysis, Signal Processing, and Dynamics
1999
·
Elsevier eBooks
·
267
Two complementary methods for predicting peptides binding major histocompatibility complex molecules
1997
·
Kamalakar Gulukota
, John Sidney
, et al.
·
Journal of Molecular Biology
·
257
PDF
The quantum query complexity of approximating the median and related statistics
1999
·
Ashwin Nayak
, Felix Wu
·
ACM Symposium on Theory of Computing (STOC)
·
224
PDF
Quantum lower bounds by polynomials
2002
·
R. Beals
, H. Buhrman
, et al.
·
Annual Symposium on Foundations of Computer Science
·
185
The polynomial method in circuit complexity
2002
·
R. Beigel
·
IEEE Conference on Computational Complexity (CCC)
·
174
Two polynomial methods of calculating functions of symmetric matrices
1989
·
V.L. Druskin
, L.A. Knizhnerman
·
USSR Computational Mathematics and Mathematical Physics
·
167
An operational approach to the Tau method for the numerical solution of non-linear differential equations
1981
·
E. L. Ortiz
, H. Samara
·
Computing
·
161
Limitations of Quantum Advice and One-Way Communication
2005
·
Scott Aaronson
·
Theory of Computing
·
157
PDF
Direct kinematics of parallel manipulators
1993
·
J.-P. Merlet
·
IEEE Transactions on Robotics and Automation
·
144
Experimental and numerical study of pulsatile flows through stenosis:
1999
·
V. Deplano
, M. Siouffi
·
Journal of Biomechanics
·
139
The Polynomial Method and Restricted Sums of Congruence Classes
1996
·
Noga Alon
, Melvyn B. Nathanson
, et al.
·
Journal of Number Theory
·
137
Robust Multi-Objective Control of VSC-Based DC-Voltage Power Port in Hybrid AC/DC Multi-Terminal Micro-Grids
2013
·
Masoud Davari
, Yasser Abdel-Rady I. Mohamed
·
IEEE Transactions on Smart Grid
·
128
Untitled
2005
·
Andris Ambainis
·
Theory of Computing
·
124
PDF
Quantum lower bound for the collision problem
2002
·
Scott Aaronson
·
ACM Symposium on Theory of Computing (STOC)
·
117
Importance of coefficient diagram in polynomial method
2004
·
S. Manabe
·
IEEE Conference on Decision and Control (CDC)
·
104
Strong Direct Product Theorems for Quantum Communication and Query Complexity
2011
·
Alexander A. Sherstov
·
SIAM Journal on Computing
·
99
PDF
On the power of Ambainis lower bounds
2005
·
Shengyu Zhang
·
Theoretical Computer Science
·
98
PDF
Fixed-Order Robust $H_{\infty}$ Controller Design With Regional Pole Assignment
2007
·
Fuwen Yang
, Mahbub Gani
, et al.
·
IEEE Transactions on Automatic Control
·
95
More applications of the polynomial method to algorithm design
·
Amir Abboud
, Ryan Williams
, et al.
·
94
Optimal Quantum Circuits for General Phase Estimation
2007
·
Wim van Dam
, G. Mauro D’Ariano
, et al.
·
Physical Review Letters
·
92
PDF
Adding Distinct Congruence Classes Modulo a Prime
1995
·
Noga Alon
, Melvyn B. Nathanson
, et al.
·
American Mathematical Monthly
·
89
Show more works
View as search
Works count:
754
Citation count:
10,190
Year
Topic
Type