Results 221 to 230 of about 1,907,337 (239)

Circuit Complexity, Proof Complexity, and Polynomial Identity Testing

, 2014
We introduce a new and very natural algebraic proof system, which has tight connections to (algebraic) circuit complexity. In particular, we show that any super-polynomial lower bound on any Boolean tautology in our proof system implies that the ...
Joshua A Grochow
exaly   +2 more sources

The Complexity of Computing the Sign of the Tutte Polynomial [PDF]

SIAM Journal on Computing, 2014
(c) 2014 Society for Industrial and Applied ...
Mark Jerrum, Leslie Ann Goldberg
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Polynomial Degree vs. Quantum Query Complexity

Journal of Computer and System Sciences, 2006
Andris Ambainis
exaly  

Complexity of Computations With Matrices and Polynomials

SIAM Review, 1992
Victor Pan
exaly  

Parameterized Complexity in the Polynomial Hierarchy

Lecture Notes in Computer Science, 2019
Ronald de Haan
exaly  

Low Complexity Bit Parallel Architectures for Polynomial Basis Multiplication Over GF(2m)

IEEE Transactions on Computers, 2004
M A Hasan
exaly  

Low-Complexity Polynomial Channel Estimation in Large-Scale MIMO With Arbitrary Statistics

IEEE Journal on Selected Topics in Signal Processing, 2014
Mérouane Debbah, Mats Bengtsson, Emil Björnson   +2 more
exaly  

Polynomial Complexity of the Newton-Puiseux Algorithm

Lecture Notes in Computer Science, 1986
A L Chistov
exaly  

Complexity of Tropical Schur Polynomials

Journal of Symbolic Computation, 2016
Gleb Koshevoy, Dima Grigoriev
exaly  

Sharper Complexity Bounds for Zero-Dimensional Gröbner Bases and Polynomial System Solving

International Journal of Algebra and Computation, 2011
Amir Hasemi
exaly