8 search results - page 1 / 2 » Algebraic Proofs over Noncommutative Formulas |
TAMC
2010
Springer
13 years 9 months ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
COCO
2005
Springer
13 years 10 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...
AMAST
2010
Springer
12 years 11 months ago
2010
Springer
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...