Volume 1. Boolean domain
"32" Result
Sort By:
Complexity theory aims to understand and classify computational problems, especially decision problems, according to their inherent complexity. This book uses new techniques to expand the theory for use with counting problems. The authors present dichotomy classifications for br…
Complexity theory aims to understand and classify computational problems, especially decision problems, according to their inherent complexity. This book uses new techniques to expand the theory for use with counting problems. The authors present dichotomy classifications for br…
The first paper introduces the notion of an abstract family of languages (AFL) and is concerned with the properties and characterizations of such families. The second is concerned with the independence of the abstract family of languages (AFL) axioms. The third is concerned with…
This Briefs volume develops the theory of entire slice regular functions. It is the first self-contained, monographic work on the subject, offering all the necessary background information and detailed studies on several central topics, including estimates on the minimum modulus…
The main result of this paper is the determination of the torsion in the SU-cobordism groups [capital Greek]Gamma[italic lowercase subscript]k. The main lines of the proof follow the methods of Wall and M. F. Atiyah. One relates SU to U by various exact sequences.
