H. Vollmer und K. W. Wagner. Complexity of functions versus complexity of sets. Oktober 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Kernel for Function Definable Classes and Its Relation to Lowness - Emme (Correct)
....found out, e.g. that the polynomial time counting hierarchy collapses if it is possible to reduce the number of accepting computation paths of a Turing machine from a polynomial time computable number to one. Eventually Vollmer and Wagner systematically studied classes of counting functions in [VW91a, VW91b] and generalized many of the known results about special function classes. They introduced an operator F, a maximum operator in a special sense, that transforms classes of sets into classes of functions with a similar complexity. We will later look at some of these function classes in connection ....
....by OTM. Further on we give some basic definitions that are essential for the following contents. Valiant introduced the class #P in [Val79] and Wagner defined the polynomial time counting hierarchy in [Wag86] Everything concerning Gap P is adopted from [FFK91] The operator F was defined in [VW91b]. ffl For a given Turing machine M acc M (x) is the number of accepting paths of M on input x; rej M (x) is the number of rejecting paths of M on input x: ffl When we talk of function classes, we mean classes F of the following type: Let ID 2 fIN ; ZZg. F consists of functions f : Sigma ....
Heribert Vollmer and Klaus W. Wagner. Complexity of functions versus complexity of sets. Technical Report 35, Universitat Wurzburg, 1991.
Analysis of the Generic Cell Rate Algorithm Monitoring.. - Ritter (1994) (10 citations) (Correct)
No context found.
H. Vollmer und K. W. Wagner. Complexity of functions versus complexity of sets. Oktober 1991.
Weak Growing Context-Sensitive Grammars - Buntrock, Niemann (1995) (11 citations) (Correct)
No context found.
H. Vollmer und K.W. Wagner. Complexity of functions versus complexity of sets. Oktober 1991.
Hardware Support for Interval Arithmetic - Gudenberg (1995) (2 citations) (Correct)
No context found.
H. Vollmer und K.W. Wagner. Complexity of functions versus complexity of sets. Oktober 1991.
Determination of Traffic Descriptors for VPs Carrying.. - García, Ritter (1995) (Correct)
No context found.
H. Vollmer und K. W. Wagner. Complexity of functions versus complexity of sets. Oktober 1991.
A Petri Net Approach for the Performance Analysis of Business.. - Schömig, Rau (1995) (1 citation) (Correct)
No context found.
H. Vollmer und K.W. Wagner. Complexity of functions versus complexity of sets. Oktober 1991.
Blocking in Multi-Service Broadband Systems with CBR and VBR.. - Hübner, Ritter (1992) (Correct)
No context found.
H. Vollmer und K. W. Wagner. Complexity of functions versus complexity of sets. Oktober 1991.
Reducing the Variance of Sojourn Times in Queueing Networks.. - Mittler, Gerlich (1993) (12 citations) (Correct)
No context found.
H. Vollmer und K.W. Wagner. Complexity of functions versus complexity of sets. Oktober 1991.
Simple and Efficient Models for Variable Bit Rate MPEG Video Traffic - Rose (1995) (22 citations) (Correct)
No context found.
H. Vollmer und K.W. Wagner. Complexity of functions versus complexity of sets. Oktober 1991.
Sojourn Time Distribution of the Asymmetric M/M/1//N-System.. - Mittler, Müller (1994) (Correct)
No context found.
H. Vollmer und K.W. Wagner. Complexity of functions versus complexity of sets. Oktober 1991.
Towards a Channel Allocation Scheme for SDMA-based Mobile.. - Gerlich, Tangemann (1995) (15 citations) (Correct)
No context found.
H. Vollmer und K. W. Wagner. Complexity of functions versus complexity of sets. Oktober 1991.
Steady-State Analysis of the Rate-Based Congestion Control.. - Ritter (1995) (17 citations) (Correct)
No context found.
H. Vollmer und K. W. Wagner. Complexity of functions versus complexity of sets. Oktober 1991.
Dimensioning of a Peak Cell Rate Monitor Algorithm Using.. - Hübner (1993) (Correct)
No context found.
H. Vollmer und K.W. Wagner. Complexity of functions versus complexity of sets. Oktober 1991.
On Cycle Times and Interdeparture Times in Semiconductor .. - Mittler, Gerlich.. (1995) (8 citations) (Correct)
No context found.
H. Vollmer und K.W. Wagner. Complexity of functions versus complexity of sets. Oktober 1991.
Artificial Neural Networks Used for Way Optimization in .. - Rothaug, Yanenkoy.. (1994) (11 citations) (Correct)
No context found.
H. Vollmer und K. W. Wagner. Complexity of functions versus complexity of sets. Oktober 1991.
Recurrent Multilayer Perceptrons for Identification and.. - K. Tutschku (1995) (10 citations) (Correct)
No context found.
H. Vollmer und K.W. Wagner. Complexity of functions versus complexity of sets. Oktober 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC