Combinatorial Complexity in O-minimal Geometry Saugata Basu

First Page		Document Content
Date: 2007-02-13 17:05:44 Mathematical structures Algebraic structures Pfaffian function O-minimal theory Pfaffian FO Betti number Structure Mathematics Algebra Model theory		Combinatorial Complexity in O-minimal Geometry Saugata Basu Add to Reading List Source URL: www.math.purdue.edu Download Document from Source Website File Size: 123,60 KB Share Document on Facebook

	HOLOGRAPHIC ALGORITHMS WITHOUT MATCHGATES J.M. LANDSBERG, JASON MORTON AND SERGUEI NORINE Abstract. The theory of holographic algorithms, which are polynomial time algorithms for certain combinatorial counting problems, DocID: 1pQ8p - View Document
	1003 Documenta Math. Pfaffian Quartic Surfaces and Representations of Clifford Algebras DocID: 1pLnh - View Document
	On Completely Integrable Pfaffian Systems with Normal Crossings Suzy Maddah University of Limoges (France) Abstract DocID: 1ml3D - View Document
	PFAFFIAN LABELINGS AND SIGNS OF EDGE COLORINGS SERGUEI NORINE AND ROBIN THOMAS Abstract. We relate signs of edge-colorings (as in classical Penrose’s result) with “Pfaffian labelings”, a generalization of Pfaffian DocID: 1kSEn - View Document
	PHYSICAL REVIEW B 88, Equivalent topological invariants for one-dimensional Majorana wires in symmetry class D Jan Carl Budich and Eddy Ardonne* Department of Physics, Stockholm University, SEStock DocID: 1fBJ6 - View Document