Bifurcation locus and branches at infinity of a polynomial $$f:\mathbb {C}^2\rightarrow \mathbb {C}$$ f : C 2 → C

T C C F     

We review links between three logic formalisms and three approaches to specifying operational semantics. In particular, we show that specifications written with (small-step and big-step) SOS, abstract machines, and multiset rewriting, are closely related to Horn clauses, binary clauses, and (a subset of) linear logic, respectively. We shall illustrate how binary clauses form a bridge between th...

Frames for subspaces of $\mathbb{C}^N$

We present a theory of finite frames for subspaces of C N. The definition of a subspace frame is given and results analogous to those from frame theory for C N are proven.

Evaluation Codes Defined by Plane Valuations at Infinity C. Galindo and F. Monserrat

We introduce the concept of δ-sequence. A δ-sequence ∆ generates a wellordered semigroup S in Z or R. We show how to construct (and compute parameters) for the dual code of any evaluation code associated with a weight function defined by ∆ from the polynomial ring in two indeterminates to a semigroup S as above. We prove that this is a simple procedure which can be understood by considering a p...

. C C ] 2 8 A pr 2 00 8 A POLYNOMIAL TIME ALGORITHM FOR 3 - SAT

Article describes a class of efficient algorithms for 3SAT and their generalizations on SAT.

k⊥-FACTORIZATION PREDICTIONS FOR F c 2 AT HERAa