Log-concavity and lower bounds for arithmetic circuits

◮ Full-Adder : a 3-input, 2-output functional block that performs the addition of the three input bits, including a third carry input bit obtained from a previous adder.. Multiple

It is an open question whether n-cycles of complex quadratic polynomials can be contained in the field Q(i) of complex rational numbers for n ≥ 5.. We prove that if such cycles

Negative intervals are processed in the increasing order of their lower bound, where the variable p is used as a pointer to the position where we may potentially find a point

In Section 5 we recall the results of Wolpert on the degeneration of the Selberg zeta function for degenerating families of compact hyperbolic Riemann surfaces [61].. We also review

However, he makes different assumptions on their curvature; his version of the Toponogov theorem has been designed as a tool towards a refined soul theorem, whereas we want to

Data representation (field element, point of curve) Computation algorithms (field and curve levels) Attacks:. Identify potential

Because we do not assume that K is a number field, our iterative construction has potential applications to class number indivisibility problems in positive characteristic

In particular, we denote by mSAC i the class of functions computable by monotone semi-unbounded fan- in circuits of polynomial size and depth O(log i n), and by co-mSAC i the