Ask
Search
My library
ORKG

ORKG Ask

Our mission is to organize scholarly knowledge and make it accessible to humans and machines.

About

About ORKG Ask
Report issue
Statistics
Contact

Legal

Terms of use
Data protection (sheet)
Imprint
Accessibility
License

Technical

We
open source
System status
Changelog
Frontend: v1.41.0
Backend: v1.13.4

We use cookies to provide a better user experience.

Data Protection

Complexity of infinite trees

Indermark, K.
Aachen Technische Hochschule (Germany). Mathematisch-Naturwissenschaftliche Fakultaet

Publication date

January 1982

Abstract

SIGLETIB: RN 3147 (84) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

Extracted data

Related items

Representations of Infinite Tree Sets

J. Pascal Gollin
Kneip, J

April 2021

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinato...

On the bounded theories of finite trees

Vorobyov, S.

January 1996

The theory of finite trees is the full first-order theory of equality in the Herbrand universum (the...

There Exists a Linear Problem with Infinite Combinatory Complexity

Wasilkowski, G.W.
Woźniakowski, H.

June 1993

AbstractWe present a linear problem whose information complexity is finite but whose combinatory com...

On frontiers of regular trees

Thomas, W.
Aachen Technische Hochschule (Germany). Lehrstuhl fuer Informatik 2

January 1985

SIGLETIB: RN 3147 (102) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbi...

On the decision complexity of the bounded theories of trees

Vorobyov, S.

January 1996

The theory of finite trees is the full first-order theory of equality in the Herbrand universe (the ...

Fundamental properties of infinite trees

Courcelle, Bruno

March 1983

AbstractInfinite trees naturally arise in the formalization and the study of the semantics of progra...

On the test complexity of tree VLSI systems

Hongzhong Wu (Saarland Univ., Saarbruecken (Germany). Fachrichtung Informatik)
Saarland Univ., Saarbruecken (Germany). Sonderforschungsbereich 124 VLSI Entwurfsmethoden und Parallelitaet
Kaiserslautern Univ. (Germany). Sonderforschungsbereich 124 VLSI Entwurfsmethoden und Parallelitaet

January 1992

SIGLEAvailable from TIB Hannover: RO 1829(1992,8) / FIZ - Fachinformationszzentrum Karlsruhe / TIB -...

The Borel hierarchy is infinite in the class of regular sets of trees

Skurczyński, Jerzy

May 1993

AbstractFor all the Borel classes of finite order, we construct weakly acceptable sets of infinite t...

Improving the representation of infinite trees to deal with sets of trees

Laurent Mauborgne

January 2000

Abstract. In order to deal efficiently with infinite regular trees (or other pointed graph structure...

Average complexity of algorithms on trees

Cases Muñoz, Rafael
Steyaert, Jean-Marc

January 1985

In this work we count the number of structures resulting from the application of different kinds of ...

The complexity of knots

Welsh, D.J.A.
Bonn Univ. (Germany). Sonderforschungsbereich 303 - Information und die Koordination Wirtschaftlicher Aktivitaeten

January 1991

SIGLEAvailable from TIB Hannover: RN 4052(90679-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB...

Uniform computational complexity of Taylor series

Mueller, N.T.
Hagen Fernuniversitaet (Germany)

January 1987

SIGLETIB: RO 5219 (66) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...

Tree Complexity and a Doubly Exponential Gap between Structured and Random Sequences

Niederreiter, Harald
Vielhaber, Michael

September 1996

AbstractThis paper introduces a new complexity measure for binary sequences, the tree complexity. Th...

On decomposition of complete infinite graphs into spanning trees

King, A.J.H

January 1990

SIGLEAvailable from British Library Document Supply Centre- DSC:DX91560 / BLDSC - British Library Do...

Searching in trees

Recker, Frank

May 2004

AbstractIn (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and...

Representations of Infinite Tree Sets

J. Pascal Gollin
Kneip, J

April 2021

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinato...

On the bounded theories of finite trees

Vorobyov, S.

January 1996

The theory of finite trees is the full first-order theory of equality in the Herbrand universum (the...

There Exists a Linear Problem with Infinite Combinatory Complexity

Wasilkowski, G.W.
Woźniakowski, H.

June 1993

AbstractWe present a linear problem whose information complexity is finite but whose combinatory com...

On frontiers of regular trees

Thomas, W.
Aachen Technische Hochschule (Germany). Lehrstuhl fuer Informatik 2

January 1985

SIGLETIB: RN 3147 (102) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbi...

On the decision complexity of the bounded theories of trees

Vorobyov, S.

January 1996

The theory of finite trees is the full first-order theory of equality in the Herbrand universe (the ...

Fundamental properties of infinite trees

Courcelle, Bruno

March 1983

AbstractInfinite trees naturally arise in the formalization and the study of the semantics of progra...

On the test complexity of tree VLSI systems

Hongzhong Wu (Saarland Univ., Saarbruecken (Germany). Fachrichtung Informatik)
Saarland Univ., Saarbruecken (Germany). Sonderforschungsbereich 124 VLSI Entwurfsmethoden und Parallelitaet
Kaiserslautern Univ. (Germany). Sonderforschungsbereich 124 VLSI Entwurfsmethoden und Parallelitaet

January 1992

SIGLEAvailable from TIB Hannover: RO 1829(1992,8) / FIZ - Fachinformationszzentrum Karlsruhe / TIB -...

The Borel hierarchy is infinite in the class of regular sets of trees

Skurczyński, Jerzy

May 1993

AbstractFor all the Borel classes of finite order, we construct weakly acceptable sets of infinite t...

Improving the representation of infinite trees to deal with sets of trees

Laurent Mauborgne

January 2000

Abstract. In order to deal efficiently with infinite regular trees (or other pointed graph structure...

Average complexity of algorithms on trees

Cases Muñoz, Rafael
Steyaert, Jean-Marc

January 1985

In this work we count the number of structures resulting from the application of different kinds of ...

The complexity of knots

Welsh, D.J.A.
Bonn Univ. (Germany). Sonderforschungsbereich 303 - Information und die Koordination Wirtschaftlicher Aktivitaeten

January 1991

SIGLEAvailable from TIB Hannover: RN 4052(90679-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB...

Uniform computational complexity of Taylor series

Mueller, N.T.
Hagen Fernuniversitaet (Germany)

January 1987

SIGLETIB: RO 5219 (66) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...

Tree Complexity and a Doubly Exponential Gap between Structured and Random Sequences

Niederreiter, Harald
Vielhaber, Michael

September 1996

AbstractThis paper introduces a new complexity measure for binary sequences, the tree complexity. Th...

On decomposition of complete infinite graphs into spanning trees

King, A.J.H

January 1990

SIGLEAvailable from British Library Document Supply Centre- DSC:DX91560 / BLDSC - British Library Do...

Searching in trees

Recker, Frank

May 2004

AbstractIn (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and...

Representations of Infinite Tree Sets

J. Pascal Gollin
Kneip, J

April 2021

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinato...

On the bounded theories of finite trees

Vorobyov, S.

January 1996

The theory of finite trees is the full first-order theory of equality in the Herbrand universum (the...

There Exists a Linear Problem with Infinite Combinatory Complexity

Wasilkowski, G.W.
Woźniakowski, H.

June 1993

AbstractWe present a linear problem whose information complexity is finite but whose combinatory com...