KOBV Portal

Hits per page

hits 1 - 10 | 16 hits

Sorting

Book

Computational molecular biology : an introduction (2000)

Clote, Peter ; Backofen, Rolf

Chichester [u.a.] :Wiley,

add to watchlist on the watchlist

Details

UID:

almafu_BV013384950

Format: IX, 286 S. : graph. Darst.

ISBN: 0-471-87251-2 , 0-471-87252-0

Series Statement: Wiley series in mathematical and computational biology

Language: English

Subjects: Computer Science , Biology

RVK:

ST 640

RVK:

WC 3420

RVK:

WC 7000

RVK:

WC 7700

RVK:

WD 4150

RVK:

WG 1700

Keywords: Molekularbiologie ; Mathematisches Modell

Bookmarklink

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Book

Inter-library loan

HU Berlin

FU Berlin

TH Wildau

BTU Cottbus

Zuse Berlin

Book

Boolean functions and computation models / (2002)

Clote, Peter ; Kranakis, Evangelos

Berlin [u.a.] :Springer,

add to watchlist on the watchlist

Details

UID:

almahu_BV013738581

Format: XIV, 601 S. : graph. Darst.

ISBN: 3-540-59436-1

Series Statement: Texts in theoretical computer science

Language: English

Subjects: Computer Science , Mathematics

RVK:

SK 130

RVK:

ST 130

RVK:

SK 890

Keywords: Computer ; Mathematisches Modell ; Boolesche Funktion ; Berechnungskomplexität ; Lehrbuch

URL: http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009390946&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA

URL: Inhaltsverzeichnis

URL: Cover

URL: Kapitel 1

URL: Inhaltsverzeichnis

URL: Inhaltstext

URL: Inhaltsverzeichnis

URL: http://www.loc.gov/catdir/enhancements/fy0817/2001031128-d.html

Bookmarklink

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Book

Inter-library loan

Stabi Berlin

HU Berlin

UB Potsdam

Berlin VÖBB/ZLB

BTU Cottbus

Book

Arithmetic, proof theory, and computational complexity : [workshop from June 1 - June 30, 1990 at the University of California at San Diego and from June 15 - July 15, 1991 at the Mathematical Institute of the Czechoslovak Academy of Sciences and the Charles University in Prague ; during each workshop, there was a 3 day international conference, the San Diego conference from June 25 - 27, 1990, the conference held in Prague from July 2 - 5, 1991] (1993)

Clote, Peter

Oxford [u.a.] :Clarendon Press,

Show associated volumes

add to watchlist on the watchlist

Details

UID:

almafu_BV008024321

Format: XII, 428 S. : , Ill., graph. Darst.

ISBN: 0-19-853690-9

Series Statement: Oxford logic guides 23

Language: English

Subjects: Mathematics

RVK:

SK 130

Keywords: Beweistheorie ; Komplexitätstheorie ; Datenverarbeitung ; Berechnungskomplexität ; Datenverarbeitung ; Beweistheorie ; Arithmetik ; Aufsatzsammlung ; Konferenzschrift ; Aufsatzsammlung ; Konferenzschrift ; Aufsatzsammlung ; Konferenzschrift ; Aufsatzsammlung

URL: http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005280261&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA

URL: Inhaltsverzeichnis

URL: Inhaltstext

URL: http://www.loc.gov/catdir/enhancements/fy0605/92041659-d.html

Bookmarklink

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Book

Inter-library loan

HU Berlin

FU Berlin

UB Potsdam

BTU Cottbus

Book

Computer science logic : 14th international workshop, CSL 2000, annual conference of the EACSL, Fischbachau, Germany, August 21 - 26, 2000 ; proceedings (2000)

Clote, Peter [Sonstige] ; CSL 14 2000 Fischbachau

Berlin [u.a.] : Springer

add to watchlist on the watchlist

Details

UID:

b3kat_BV013289574

Format: XIII, 541 S.

ISBN: 3540678956

Series Statement: Lecture notes in computer science 1862

Note: Literaturangaben

Language: English

Keywords: Theoretische Informatik ; Logik ; Logische Programmierung ; Programmierlogik ; Komplexitätstheorie ; Konferenzschrift ; Konferenzschrift

URL: Inhaltsverzeichnis

URL: Cover

URL: Kapitel 1

URL: Inhaltsverzeichnis

URL: Inhaltstext

Bookmarklink

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Book

Inter-library loan

Stabi Berlin

UB Potsdam

TU Berlin

Online Resource

Feasible Mathematics II (1995)

Clote, Peter. [editor.] ; Remmel, Jeffrey B. [editor.] ; SpringerLink 〈Online service〉

Boston, MA :Birkhäuser Boston,

add to watchlist on the watchlist

Details

UID:

almahu_9947362841802882

Format: 447 p. , online resource.

ISBN: 9781461225669

Series Statement: Progress in Computer Science and Applied Logic ; 13

Content: Perspicuity is part of proof. If the process by means of which I get a result were not surveyable, I might indeed make a note that this number is what comes out - but what fact is this supposed to confirm for me? I don't know 'what is supposed to come out' . . . . 1 -L. Wittgenstein A feasible computation uses small resources on an abstract computa tion device, such as a 'lUring machine or boolean circuit. Feasible math ematics concerns the study of feasible computations, using combinatorics and logic, as well as the study of feasibly presented mathematical structures such as groups, algebras, and so on. This volume contains contributions to feasible mathematics in three areas: computational complexity theory, proof theory and algebra, with substantial overlap between different fields. In computational complexity theory, the polynomial time hierarchy is characterized without the introduction of runtime bounds by the closure of certain initial functions under safe composition, predicative recursion on notation, and unbounded minimization (S. Bellantoni); an alternative way of looking at NP problems is introduced which focuses on which pa rameters of the problem are the cause of its computational complexity and completeness, density and separation/collapse results are given for a struc ture theory for parametrized problems (R. Downey and M. Fellows); new characterizations of PTIME and LINEAR SPACE are given using predicative recurrence over all finite tiers of certain stratified free algebras (D.

Note: Preface -- On the Existence of modulo p Cardinality Functions -- Predicative Recursion and The Polytime Hierarchy -- Are there Hard Examples for Frege Systems? -- On Godel’s Theorems on Lengths of Proofs II: Lower Bounds for Recognizing k Symbol Provability -- Feasibly Categorical Abelian Groups -- First Order Bounded Arithmetic and Small Boolean Circuit Complexity Classes -- Parameterized Computational Feasibility -- On Proving Lower Bounds for Circuit Size -- Effective Properties of Finitely Generated R.E. Algebras -- On Frege and Extended Frege Proof Systems -- Ramified Recurrence and Computational Complexity I: Word Recurrence and Poly-time -- Bounded Arithmetic and Lower Bounds in Boolean Complexity -- Ordinal Bounds for Programs -- Turing Machine Characterizations of Feasible Functionals of All Finite Types -- The Complexity of Feasible Interpretability.

In: Springer eBooks

Additional Edition: Printed edition: ISBN 9781461275824

Language: English

Keywords: Konferenzschrift

DOI: 10.1007/978-1-4612-2566-9

URL: http://dx.doi.org/10.1007/978-1-4612-2566-9

URL: Volltext

Bookmarklink

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Online Resource

Online Access

Open Access Request

HU Berlin

BTU Cottbus

Book

Arithmetic, proof theory, and computational complexity / (2000)

Clote, Peter

Oxford :Clarendon Press,

Show associated volumes

add to watchlist on the watchlist

Details

UID:

almahu_BV025263889

Format: XII, 428 S. : , Ill.

Edition: Reprint.

ISBN: 0-19-853690-9

Series Statement: Oxford logic guides 23

Language: English

Subjects: Mathematics

RVK:

SK 130

Keywords: Beweistheorie ; Komplexitätstheorie ; Datenverarbeitung ; Berechnungskomplexität ; Datenverarbeitung ; Beweistheorie ; Arithmetik ; Aufsatzsammlung ; Konferenzschrift ; Aufsatzsammlung

Bookmarklink

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Book

Inter-library loan

HU Berlin

UB Potsdam

Online Resource

Computer Science Logic : 14th InternationalWorkshop, CSL 2000 Annual Conference of the EACSL Fischbachau, Germany, August 21 – 26, 2000 Proceedings (2000)

Clote, Peter 1951- ; Schwichtenberg, Helmut 1942-

Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg

add to watchlist on the watchlist

Details

UID:

gbv_1649371691

Format: Online-Ressource

ISBN: 9783540446224 , 3540678956

Series Statement: Lecture Notes in Computer Science 1862

Content: This book constitutes the refereed proceedings of the 13th International Workshop on Computer Science Logic, CSL 2000, held in Fischbachau, Germany as the 8th Annual Conference of the EACSL in August 2000. The 28 revised full papers presented together with eight invited papers were carefully reviewed and selected by the program committee. Among the topics covered are automated deduction, theorem proving, categorical logic, term rewriting, finite model theory, higher order logic, lambda and combinatory calculi, computational complexity, logic programing, constraints, linear logic, modal logic, temporal logic, model checking, formal specification, formal verification, program transformation, etc

Note: Literaturangaben

Additional Edition: ISBN 9783540678953

Additional Edition: Buchausg. u.d.T. Computer science logic Berlin : Springer, 2000 ISBN 3540678956

Language: English

Keywords: Theoretische Informatik ; Logik ; Programmierlogik ; Logische Programmierung ; Logik ; Theoretische Informatik ; Konferenzschrift ; Konferenzschrift

DOI: 10.1007/3-540-44622-2

URL: Volltext (lizenzpflichtig)

URL: Volltext

URL: Volltext (lizenzpflichtig)

URL: Cover

URL: Kapitel 1

URL: Inhaltsverzeichnis

URL: Inhaltstext

Author information: Schwichtenberg, Helmut 1942-

Bookmarklink

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Online Resource

Online Access

Open Access Request

UB Potsdam

Book

Feasible mathematics II : [... workshop Feasible Mathematics II, which took place at Cornell from May 28 - 30, 1992, ...] (1995)

Clote, Peter ; Workshop Feasible Mathematics 2 1992 Ithaca, NY

Boston [u.a.] :Birkhäuser,

Show associated volumes

add to watchlist on the watchlist

Details

UID:

almahu_BV010177883

Format: VIII, 447 S.

ISBN: 0-8176-3675-7 , 3-7643-3675-7

Series Statement: Progress in computer science and applied logic 13

Language: English

Subjects: Computer Science

RVK:

ST 600

Keywords: Computer ; Komplexität ; Konferenzschrift

Bookmarklink

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Book

Inter-library loan

HU Berlin

Online Resource

Computer Science Logic : 14th International Workshop, CSL 2000 Annual Conference of the EACSL Fischbachau, Germany, August 21-26, 2000 Proceedings (2000)

Clote, Peter G. [editor.] ; Schwichtenberg, Helmut. [editor.] ; SpringerLink 〈Online service〉

Berlin, Heidelberg :Springer Berlin Heidelberg :

Show associated volumes

add to watchlist on the watchlist

Details

UID:

almahu_9948621693902882

Format: XIV, 550 p. , online resource.

Edition: 1st ed. 2000.

ISBN: 9783540446224

Series Statement: Lecture Notes in Computer Science, 1862

Note: Invited Papers -- Background, Reserve, and Gandy Machines -- Choiceless Polynomial Time Computation and the Zero-One Law -- Composition and Submachine Concepts for Sequential ASMs -- Une tentative malheureuse de construire une structure éliminant rapidement les quanteurs -- Translating Theory into Practice - Abstract State Machines within Microsoft -- Choiceless Polynomial Time Logic: Inability to Express -- Schema Revisited -- Automated Verification = Graphs, Automata, and Logic -- Contributed Papers -- A Fully Complete PER Model for ML Polymorphic Types -- Subtyping with Power Types -- The Descriptive Complexity of the Fixed-Points of Bounded Formulas -- Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic -- Continuous Functionals of Dependent Types and Equilogical Spaces -- Definability over Linear Constraints -- Bounded Arithmetic and Descriptive Complexity -- Independence: Logics and Concurrency -- Flatness Is Not a Weakness -- Sequents, Frames, and Completeness -- Disjunctive Tautologies as Synchronisation Schemes -- Axiomatizing the Least Fixed Point Operation and Binary Supremum -- Interactive Programs in Dependent Type Theory -- Modal Satisfiability Is in Deterministic Linear Space -- Logic Programming and Co-inductive Definitions -- A Theory of Explicit Mathematics Equivalent to ID 1 -- On the Complexity of Explicit Modal Logics -- Finite Models and Full Completeness -- On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale -- Elimination of Negation in a Logical Framework -- Discreet Games, Light Affine Logic and PTIME Computation -- Completeness of Higher-Order Duration Calculus -- Equational Termination by Semantic Labelling -- On the Computational Interpretation of Negation -- From Programs to Games: Invariance and Safety for Bisimulation -- Logical Relations and Data Abstraction -- Elementary Choiceless Constructive Analysis -- On the Logic of the Standard Proof Predicate.

In: Springer Nature eBook

Additional Edition: Printed edition: ISBN 9783662178294

Additional Edition: Printed edition: ISBN 9783540678953

Language: English

DOI: 10.1007/3-540-44622-2

URL: https://doi.org/10.1007/3-540-44622-2

Bookmarklink

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Online Resource

Open Access Request

HU Berlin

Online Resource

Boolean Functions and Computation Models (2002)

Clote, Peter. ; Kranakis, Evangelos. ; SpringerLink 〈Online service〉

Berlin, Heidelberg :Springer Berlin Heidelberg :

add to watchlist on the watchlist

Details

UID:

almahu_9948621121302882

Format: XIV, 602 p. , online resource.

Edition: 1st ed. 2002.

ISBN: 9783662049433

Series Statement: Texts in Theoretical Computer Science. An EATCS Series,

Content: This textbook presents a survey of research on boolean functions, circuits, parallel computation models, function algebras, and proof systems. Its main aim is to elucidate the structure of "fast" parallel computation. The complexity of parallel computation is emphasized through a variety of techniques ranging from finite combinatorics, probability theory, and finite group theory to finite model theory and proof theory. Nonuniform computation models are studied in the form of boolean circuits, uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems. The book will benefit advanced undergraduate and graduate students as well as researchers in the field of complexity theory.

Note: 1. Boolean Functions and Circuits -- 2. Circuit Lower Bounds -- 3. Circuit Upper Bounds -- 4. Randomness and Satisfiability -- 5. Propositional Proof Systems -- 6. Machine Models and Function Algebras -- 7. Higher Types -- References.

In: Springer Nature eBook

Additional Edition: Printed edition: ISBN 9783642082177

Additional Edition: Printed edition: ISBN 9783540594369

Additional Edition: Printed edition: ISBN 9783662049440

Language: English

DOI: 10.1007/978-3-662-04943-3

URL: https://doi.org/10.1007/978-3-662-04943-3

Bookmarklink

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Online Resource

Open Access Request

HU Berlin

hits 1 - 10 | 16 hits

Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.

Kooperativer Bibliotheksverbund

Berlin Brandenburg