Skip to search formSkip to main contentSkip to account menu

Structural complexity theory

Known as: Structural complexity, Structural computational complexity 
In computational complexity theory of computer science, the structural complexity theory or simply structural complexity is the study of complexity… 
Wikipedia (opens in a new tab)

Related topics

Related topics

33 relations
Berman–Hartmanis conjectureBoolean satisfiability problemComplexity classCompression theorem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2013
Review
2013
Identifying Uncertainties within Structural Complexity Management
Structural complexity management (StCM) is an established methodology to manage complexity within engineering design. Complexity… 
2013
2013
Expected π-Adic Security Measures of Sequences
Various measures of security of stream ciphers have been studied that are based on the problem of finding a minimum size… 
2010
2010
Arithmetization: a New Method in Structural Complexity Theory
We introduce a technique of arithmetization of the process of computation in order to obtain novel characterizations of certain… 
Review
2007
Review
2007
On the development of Emil Post's ideas in structural complexity theory
Structural complexity theory is one of the branches of computer science. In this survey we will show how notions of a complete r… 
Review
2003
Review
2003
Processing of audio signals by neural networks
It is well known that the most important techniques for digital signal processing (DSP) are based on linear models. In some cases… 
2002
2002
Transportation Security Activities in Texas
Texas has the largest bridge inventory of any state, with nearly 33,000 on-system and 17,000 off-system bridges. This inventory… 
1999
1999
Oracles and Queries that are Su(cid:14)cient for Exact Learning
We show that the class of all circuits is exactly learnable in randomized expected polynomial time using weak subset and weak… 
1995
1995
On some promise classes in structural complexity theory
In dieser Dissertation werden sogenannte ,,promise classes`` studiert, wie z.B. die wichtigen Komplexitatsklassen UP und FewP… 
Review
1994
Review
1994
Probabilistic Complexity Classes 1 Waterloo, plus Some Additional Results Included in Chapter 4 (theorem 4.4)
The purpose of this work is to present an overview of the class of problems solvable in probabilistic polynomial time with double… 
1968
1968
Symbols, Relations, and Structural Complexity.
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)