katona gyula o h (44 Ergebnisse)

25 cm. 545 p. Softcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Stamped. Bolyai Society mathematical studies Bd. 19. Sprache: Englisch.

Softcover. Zustand: Gut. Gebraucht - Gut Zustand: Gut, IX, 229 p. Also available online. About this book This book constitutes the thoroughly refereed post-proceedings of the Second International Workshop on Semantics in Databases, held in Dagstuhl Castle, Germany, in January 2001. The 10 revised full papers presented together with an introduction by the volume editors were carefully selected during two rounds of reviewing. Among the aspects of database semantics discussed are semantic constraints, paraconsistency, logic foundations of databases, ER modeling, type hierarchies, null values, consistency enforcement, logic-based pattern languages, and semantic classification of queries. Among the classes of databases dealt with are deductive databases, relational databases, distributed information systems, and tree-structured data. Written for researchers and professionals.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 284 | Sprache: Englisch | Produktart: Bücher.

Hardcover. [1st edition]. xii, 614 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library in GOOD condition with library-signature and stamp(s). Some traces of use. R-16862 9783662592038 Sprache: Englisch Gewicht in Gramm: 1050.

Zustand: New. In.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 420 | Sprache: Englisch | Produktart: Bücher.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 372 | Sprache: Englisch | Produktart: Sonstiges.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This is the second volume of the procedings of the second European Congress of Mathematics. Volume I presents the speeches delivered at the Congress, the list of lectures, and short summaries of the achievements of the prize winners. Together with volume II it contains a collection of contributions by the invited lecturers. Finally, volume II also presents reports on some of the Round Table discussions. This two-volume set thus gives an overview of the state of the art in many fields of mathematics and is therefore of interest to every professional mathematician. Contributors: Vol. I: N. Alon, L. Ambrosio, K. Astala, R. Benedetti, Ch. Bessenrodt, F. Bethuel, P. Bjørstad, E. Bolthausen, J. Bricmont, A. Kupiainen, D. Burago, L. Caporaso, U. Dierkes, I. Dynnikov, L.H. Eliasson, W.T. Gowers, H. Hedenmalm, A. Huber, J. Kaczorowski, J. Kollár, D.O. Kramkov, A.N. Shiryaev, C. Lescop, R. März. Vol. II: J. Matousek, D. McDuff, A.S. Merkurjev, V. Milman, St. Müller, T. Nowicki, E. Olivieri, E. Scoppola, V.P. Platonov, J. Pöschel, L. Polterovich , L. Pyber, N. Simányi, J.P. Solovej, A. Stipsicz, G. Tardos, J.-P. Tignol, A.P. Veselov, E. Zuazua.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The present volume is a collection of survey papers in the elds given in the title. They summarize the latest developments in their respective areas. More than half of the papers belong to search theory which lies on the borderline of mathematics and computer science, information theory and combinatorics, respectively. The volume is slightly related to the twin conferences 'Search And Communication Complexity' and 'Information Theory In Mathematics' held at Balatonlelle, Hungary in 2000. These conferences led us to believe that there is a need for such a collection of papers. The paper written by Martin Aigner starts with the following relatively new search problem. Given n boolean variables as input one has to nd one of them whose value is in majority. The goal is to minimize the number of tests needed for this where one test is to compare two input variables for equality. The paper surveys the large set of problems and results which grew out of this one. In the traditional search model an unknown element is sought in a nite set, based on the information that the unknown element is or is not in some (asked) subsets. A variant is when a 0,1 function is given on the underlying set, and only the values of this function at the unknown element x is sought rather than x itself. This is called the recognition problem.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Discrete mathematics, including (combinatorial) number theory and set theory has always been a stronghold of Hungarian mathematics. The present volume honouring Vera Sos and Andras Hajnal contains survey articles (with classical theorems and state-of-the-art results) and cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian subjects, like extremal combinatorics, colorings, combinatorial number theory, etc. The open problems and the latest results in the papers inspire further research. The volume is recommended to experienced specialists as well as to young researchers and students.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Hungarian mathematics has always been known for discrete mathematics, including combinatorial number theory, set theory and recently random structures, combinatorial geometry as well. The recent volume contains high level surveys on these topics with authors mostly being invited speakers for the conference 'Horizons of Combinatorics' held in Balatonalmadi, Hungary in 2006. The collection gives a very good overview of recent trends and results in a large part of combinatorics and related topics, and offers an interesting reading for experienced specialists as well as to young researchers and students.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Discrete Mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is László Lovász, whose outstanding scientific work has defined and shaped many research directions in the past 40 years. A number of friends and colleagues, all top authorities in their fields of expertise gathered at the two conferences in August 2008 in Hungary, celebrating Lovász' 60th birthday. It was a real fete of combinatorics and computer science. Some of these plenary speakers submitted their research or survey papers prior to the conferences. These are included in the volume 'Building Bridges'. The other speakers were able to finish their contribution only later, these are collected in the present volume.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Discrete mathematics, including (combinatorial) number theory and set theory has always been a stronghold of Hungarian mathematics. The present volume honouring Vera Sos and Andras Hajnal contains survey articles (with classical theorems and state-of-the-art results) and cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian subjects, like extremal combinatorics, colorings, combinatorial number theory, etc. The open problems and the latest results in the papers inspire further research. The volume is recommended to experienced specialists as well as to young researchers and students.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The present volume is a collection of survey papers in the elds given in the title. They summarize the latest developments in their respective areas. More than half of the papers belong to search theory which lies on the borderline of mathematics and computer science, information theory and combinatorics, respectively. The volume is slightly related to the twin conferences 'Search And Communication Complexity' and 'Information Theory In Mathematics' held at Balatonlelle, Hungary in 2000. These conferences led us to believe that there is a need for such a collection of papers. The paper written by Martin Aigner starts with the following relatively new search problem. Given n boolean variables as input one has to nd one of them whose value is in majority. The goal is to minimize the number of tests needed for this where one test is to compare two input variables for equality. The paper surveys the large set of problems and results which grew out of this one. In the traditional search model an unknown element is sought in a nite set, based on the information that the unknown element is or is not in some (asked) subsets. A variant is when a 0,1 function is given on the underlying set, and only the values of this function at the unknown element x is sought rather than x itself. This is called the recognition problem.