Suchergebnisse - Complexity Measures and Classes—Complexity hierarchies
-
1
Cognitive Weighted Inherited Class Complexity Metric
ISSN: 1877-0509, 1877-0509Veröffentlicht: Elsevier B.V 2018Veröffentlicht in Procedia computer science (2018)“… In the software industry, the class complexity of an object oriented programis measured using various factors such as counting the number of lines of code, methods, attributes, functional points, etc …”
Volltext
Journal Article -
2
On the computational complexity of membrane systems
ISSN: 0304-3975, 1879-2294Veröffentlicht: Amsterdam Elsevier B.V 12.06.2004Veröffentlicht in Theoretical computer science (12.06.2004)“… We define space and time complexity measures and show hierarchies of complexity classes similar to well-known results concerning Turing machines and counter machines …”
Volltext
Journal Article -
3
Measuring nondeterminism in pushdown automata
ISSN: 0022-0000, 1090-2724Veröffentlicht: Elsevier Inc 01.11.2005Veröffentlicht in Journal of computer and system sciences (01.11.2005)“… We show that this measure is similar to other complexity measures in that it gives rise to an infinite hierarchy of complexity classes of context-free languages differing in the amount of the resource (in this case, nondeterminism) that they require. In addition, we show that there are context-free languages that can only be recognized by a pushdown automaton whose nondeterminism grows linearly, resolving an open problem in the literature. In particular, the set of palindromes is such a language …”
Volltext
Journal Article -
4
Lower bounds for one-way probabilistic communication complexity and their application to space complexity
ISSN: 0304-3975, 1879-2294Veröffentlicht: Elsevier B.V 05.05.1996Veröffentlicht in Theoretical computer science (05.05.1996)“… Our lower bounds are good enough for proving that proper hierarchy for one-way probabilistic communication complexity classes depends on a measure …”
Volltext
Journal Article -
5
On the Complexity of Computing the Shuffled Inequality Function in Classical and Quantum NOBDDs
ISSN: 1066-369X, 1934-810XVeröffentlicht: Moscow Pleiades Publishing 01.01.2025Veröffentlicht in Russian mathematics (01.01.2025)“… It is known that OBDD’s complexity can extremely depend on the order of reading variables. There are techniques for constructing functions that do not allow choosing the optimal order for reading the input, one of which we use in this paper …”
Volltext
Journal Article -
6
Complexity of well-ordered sets in an ordered Abelian group
ISSN: 0026-9255, 1436-5081Veröffentlicht: 11.06.2025Veröffentlicht in Monatshefte für Mathematik (11.06.2025)Volltext
Journal Article -
7
Decomposition of inheritance hierarchy DAGs for object-oriented software metrics
ISBN: 9780818678899, 0818678895Veröffentlicht: IEEE 1997Veröffentlicht in Engineering of Computer-Based Systems, 1997 Conference (1997)“… ) to realize and measure the object-oriented software complexity of a class hierarchy. The approach is based on the graph-theoretical model for measuring the hierarchical complexity in inheritance relations …”
Volltext
Tagungsbericht -
8
Computational Complexity of Multiple Recursive Schemata
ISSN: 0097-5397, 1095-7111Veröffentlicht: Philadelphia Society for Industrial and Applied Mathematics 01.09.1976Veröffentlicht in SIAM journal on computing (01.09.1976)“… The computational complexity properties of a hierarchy of classes of subrecursive schemata are investigated …”
Volltext
Journal Article -
9
Randomness and completeness in computational complexity
ISBN: 9780599324480, 0599324481Veröffentlicht: ProQuest Dissertations & Theses 01.01.1999“… Computational complexity studies the inherent difficulty of computational problems and the power of the tools we may use to solve …”
Volltext
Dissertation -
10
Computational complexity and learnability of two vowel harmony patterns with neutral vowels
ISSN: 1226-8690, 2671-616XVeröffentlicht: 한국음운론학회 01.04.2020Veröffentlicht in 음성음운형태론연구 (01.04.2020)“… In this paper, the hypothesis is tested as the Subregular Hypothesis, which measures computational complexity in terms of the Subregular Hierarchy …”
Volltext
Journal Article -
11
Inverse monoids and the dot-depth hierarchy
ISBN: 9798207096285Veröffentlicht: ProQuest Dissertations & Theses 01.01.1988“… Finite automata and rational languages are fundamental concepts in theoretical computer science and they have been extensively studied since the 1950's. The …”
Volltext
Dissertation -
12
Category and Measure in Complexity Classes
ISSN: 0097-5397, 1095-7111Veröffentlicht: Philadelphia, PA Society for Industrial and Applied Mathematics 01.12.1990Veröffentlicht in SIAM journal on computing (01.12.1990)“… This paper presents resource-bounded category and resource-bounded measure--two new tools for computational complexity theory--and some applications of these tools to the structure theory …”
Volltext
Journal Article -
13
Succinct representation random strings, and complexity classes
ISSN: 0272-5428Veröffentlicht: IEEE 01.10.1980Veröffentlicht in Annual Symposium on Foundations of Computer Science (01.10.1980)“… measure but not to another can show the relationship between the corresponding complexity classes …”
Volltext
Tagungsbericht -
14
Some complexity metrics for object-oriented programs based on information flow
ISBN: 0818640308, 9780818640308Veröffentlicht: IEEE Comput. Soc. Press 1993Veröffentlicht in CompEuro '93: Computers in Design, Manufacturing and Production (1993)“… These metrics may be used to measure methods, classes, class hierarchies, and programs in an object-oriented system …”
Volltext
Tagungsbericht

