Modified branching programs and their computational power :: SCD d'Orléans

Modified branching programs and their computational power

Modified branching programs and their computational power

Branching Programs are, besides Boolean circuits, the most important nonuniform model of computation. This volume gives a survey of the latest research in this field. It presents a branching program-based approach to complexity theory. Starting with a definition of branching programs and a review of...

保存先:

書誌詳細
第一著者:	Meinel, Christoph, 1954-...., Professeur
フォーマット:	Livre numérique
言語:	Anglais
出版事項:	Berlin [etc.] : Springer [20..]. Cham : Springer Nature
シリーズ:	Lecture notes in computer science 370
主題:	Informatique Algorithmes Complexité de calcul (informatique) Analyse combinatoire Processus ramifiés
オンライン･アクセス:	Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL
注記:	Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale)
Autres localisations:	Voir dans le Sudoc
Edition sous un autre format:	• Modified branching programs and their computational power, Christoph Meinel, Berlin, Springer-Verlag, 1989, 1 vol. (VI-132 p.), Lecture notes in computer science, 3-540-51340-X • Modified Branching Programs and Their Computational Power, Texte imprimé, 9783662163597

類似資料

Complexity and structure
著者:: Schöning, Uwe, 1955-

Algorithm theory - SWAT '94 : 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 6 8, 1994 : proceedings

Algorithms and complexity : second Italian conference, CIAC '94, Rome, Italy, February 23-25, 1994 : proceedings

Algorithm theory - SWAT '96 : 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3 5, 1996 : proceedings

Algorithms and complexity : third Italian conference, CIAC '97, Rome, Italy, March 12-14, 1997 : proceedings

Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 2000 : proceedings

SWAT 90 : 2nd Scandinavian workshop on algorithm theory, Bergen, Sweden, July 11 14, 1990 : proceedings

Trees in algebra and programming - CAAP '94 : 19th International Colloquium, Edinburgh, U.K., April 11 13, 1994 : proceedings

Algorithm theory - SWAT '92 : Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8 10, 1992 : proceedings

Fundamentals of computation theory : 8th International Conference, FCT '91 Gosen, Germany, September 9 13, 1991 : proceedings

Branching processes
著者:: Joffe, Anatole, 1932-
出版事項: (1978)

The theory of branching processes
著者:: Harris, Theodore Edward, 1919-2006
出版事項: (1963)

Bounded : incremental computation
著者:: Ramalingam, Ganesan, 19..-

Randomness and completeness in computational complexity
著者:: Van Melkebeek, Dieter

Algorithm theory - SWAT 2000 : 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5 7, 2000 : proceedings

Lectures on proof verification and approximation algorithms
著者:: Mayr, Ernst W., 1950-

Fundamentals of computation theory : International Conference FCT '89 Szeged, Hungary, August 21 25, 1989 : proceedings

Classical and modern branching processes

Classical and modern branching processes
出版事項: (1997)

Branching processes in biology
著者:: Kimmel, Marek, 1959-, 等
出版事項: (2002)

Branching Processes in Biology
著者:: Kimmel, Marek, 1959-, 等

Branching processes and neutral evolution
著者:: Taïb, Ziad
出版事項: (1992)

Discrete mathematics and theoretical computer science : 4th international conference, DMTCS 2003, Dijon, France, July 7-12, 2003 : proceedings

Sparsity : graphs, structures, and algorithms
著者:: Nešetřil, Jaroslav, 1946-...., Mathématicien, 等

Graph-theoretic concepts in computer science : 24th international workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, 1998 : proceedings

Computers and intractability : A guide to the theory of NP-completeness
著者:: Garey, Michael R., 等
出版事項: (1979)

Random sums and branching stochastic processes
著者:: Rahimov, Ibrahim
出版事項: (1995)

Approximation algorithms for combinatorial optimization : 5th international workshop, APPROX 2002, Rome, Italy, September 17-21, 2002 : proceedings

Discrete and computational geometry : Japanese conference, JCDCG 2000, Tokyo, Japan, November 22-25, 2000 : revised papers

Combinatorial optimization : networks and matroids
著者:: Lawler, Eugène L., 19..-
出版事項: (1976)

Computational science and its applications - ICCSA 2003 : International conference Montreal, Canada, May 18 21, 2003 : proceedings, part II

Computational science and its applications - ICCSA 2003 : International conference Montreal, Canada, May 18 21, 2003 : proceedings, part I

Computational science and its applications - ICCSA 2003 : International conference Montreal, Canada, May 18 21, 2003 : proceedings, part III

Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers
著者:: Leivant, Daniel

Combinatorial optimization : algorithms and complexity
著者:: Papadimitriou, Christos H., 1949-, 等
出版事項: (1982)

Towards dynamic randomized algorithms in computational geometry
著者:: Teillaud, Monique, 1961-

Computational discrete mathematics : advanced lectures
著者:: Alt, Helmut, 1950-

Spatial branching processes, random snakes and partial differential equations
著者:: Le Gall, Jean-François, 1959-
出版事項: (1999)

Discrete and computational geometry : [second] Japanese conference, JCDCG'98, Tokyo, Japan, December 9-12, 1998, revised papers

Algorithms and computation : 8th International Symposium, ISAAC '97, Singapore, December 17-19, 1997 : proceedings

© 2021-2023 • Université d'Orléans, Service Commun de Documentation, 6 rue de Tours, 45072 Orléans cedex 2
+33(0) 2 38 41 71 84 • https://scd.univ-orleans.fr • Mentions légales