On testing monomials in multivariate polynomials (Q391220): Difference between revisions

@@ Property / author @@
-Zhixiang Chen
@@ Property / author: Zhixiang Chen / rank @@
-Normal rank
@@ Property / author @@
-Robert T. Schweller
@@ Property / author: Robert T. Schweller / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2012.03.038
+Normal rank
@@ Property / OpenAlex ID @@
+W2045732794
@@ Property / OpenAlex ID: W2045732794 / rank @@
+Normal rank
@@ Property / cites work @@
+Primality and identity testing via Chinese remaindering
+Normal rank
@@ Property / cites work @@
+PRIMES is in P
@@ Property / cites work: PRIMES is in P / rank @@
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for testing the truth of certain quantified Boolean formulas
+Normal rank
@@ Property / cites work @@
+The Complexity of Testing Monomials in Multivariate Polynomials
+Normal rank
@@ Property / cites work @@
+Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials
+Normal rank
@@ Property / cites work @@
+Algorithms for Testing Monomials in Multivariate Polynomials
+Normal rank
@@ Property / cites work @@
+Q2934608
@@ Property / cites work: Q2934608 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness II: On completeness for W[1]
+Normal rank
@@ Property / cites work @@
+Q4942157
@@ Property / cites work: Q4942157 / rank @@
+Normal rank
@@ Property / cites work @@
+Interactive proofs and the hardness of approximating cliques
+Normal rank
@@ Property / cites work @@
+SeparatingPH fromPP by relativization
@@ Property / cites work: SeparatingPH fromPP by relativization / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Derandomizing polynomial identity tests means proving circuit lower bounds
+Normal rank
@@ Property / cites work @@
+Learning DNF in time
@@ Property / cites work: Learning DNF in time / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Algebraic Algorithms for Path and Packing Problems
+Normal rank
@@ Property / cites work @@
+Q3996586
@@ Property / cites work: Q3996586 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4231923
@@ Property / cites work: Q4231923 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic polynomial identity testing in non-commutative models
+Normal rank
@@ Property / cites work @@
+Algorithms for maximum independent sets
@@ Property / cites work: Algorithms for maximum independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+IP = PSPACE
@@ Property / cites work: IP = PSPACE / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths of length \(k\) in \(O^{*}(2^k)\) time
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:391220