Search Results - Complexity Classes—Complexity hierarchies

Quantum and classical nondeterministic OBDDs by Gainutdinova, A. F.

“…   A model of nondeterministic ordered binary decision diagrams (NOBDDs) was analyzed. A method for proving a lower bound on the complexity of quantum NOBDDs was developed…”
Get full text

Refined Kolmogorov complexity of analog, evolving and stochastic recurrent neural networks by Cabessa, Jérémie, Strozecki, Yann

“…, and real probabilities, respectively. First, we retrieve the infinite hierarchy of complexity classes of analog networks, defined in terms of the Kolmogorov complexity of their real weights…”
Get full text

Logical Foundations of Proof Complexity by Cook, Stephen, Nguyen, Phuong

“… The complexity classes range from AC0 for the weakest theory up to the polynomial hierarchy. Each bounded theorem in a theory translates into a family of (quantified…”
Get full text

Cognitive Weighted Inherited Class Complexity Metric by Maheswaran, K., Aloysius, A.

“…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…”
Get full text

‘And You Need Me to Be the Token Mexican?’: Examining Racial Hierarchies and the Complexities of Racial Identities for Middle Class Mexican Americans by Delgado, Daniel J.

“… This research concludes that these middle class Mexican Americans utilize different identity practices to navigate racism and racial hierarchies…”
Get full text

Reversal complexity revisited by Hernich, André, Schweikardt, Nicole

“…We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r ( n )…”
Get full text

Reachability in Vector Addition Systems is Ackermann-complete by Czerwinski, Wojciech, Orlikowski, Lukasz

“…} is the k -th complexity class from the hierarchy of fast-growing complexity classes…”
Get full text

Completeness for the Complexity Class ∀∃R and Area-Universality by Dobbins, Michael Gene, Kleist, Linda, Miltzow, Tillmann, Rzążewski, Paweł

“…, ∃ R deals with existentially quantified real variables. In analogy to Π 2 p and Σ 2 p in the famous polynomial hierarchy, we study the complexity classes ∀ ∃ R…”
Get full text

Parameterized complexity of weighted team definability by Kontinen, Juha, Mahmood, Yasir, Meier, Arne, Vollmer, Heribert

“…In this article, we study the complexity of weighted team definability for logics with team semantics…”
Get full text

The parameterized space complexity of model-checking bounded variable first-order logic by Chen, Yijia, Elberfeld, Michael, Müller, Moritz

“… For each bound on the quantifier alternation rank the problem becomes complete for the corresponding level of what we call the tree hierarchy, a hierarchy of parameterized complexity classes defined…”
Get full text

A Complexity Theory of Constructible Functions and Sheaves by Basu, Saugata

“…In this paper we introduce constructible analogs of the discrete complexity classes VP and VNP of sequences of functions…”
Get full text

Minimax Games, Spin Glasses and the Polynomial-Time Hierarchy of Complexity Classes by Varga, Peter

“…We use the negative replica method, which was originally developed for the study of overfrustation in disordered system, to investigate the statistical…”
Get full text

Dependence Logic with a Majority Quantifier by Durand, Arnaud, Ebbing, Johannes, Kontinen, Juha, Vollmer, Heribert

“… Our results imply that, from the point of view of descriptive complexity theory, 𝓓(M) captures the complexity class counting hierarchy…”
Get full text

Circuit complexity and functionality: A statistical thermodynamics perspective by Chamon, Claudio, Ruckenstein, Andrei E, Mucciolo, Eduardo R, Canetti, Ran

“…Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science…”
Get more information

More results on the complexity of identifying problems in graphs by Hudry, Olivier, Lobstein, Antoine

“… We locate these problems in the complexity classes of the polynomial hierarchy…”
Get full text

On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics by Gaggl, Sarah Alice, Rudolph, Sebastian, Straß, Hannes

“… We perform an exhaustive analysis of the computational complexity of these new, so-called naive-based semantics…”
Get full text

Re-examining regular expressions with backreferences by Berglund, Martin, van der Merwe, Brink

“… Beyond the hierarchy itself, some complexity results are given, and as part of the effort on comparing language classes new pumping lemmas are established, old classes are extended to new ones, and several incidental results on the nature of these language classes are given…”
Get full text

Exponential separation between quantum and classical ordered binary decision diagrams, reordering method and hierarchies by Khadiev, Kamil, Khadieva, Aliya, Knop, Alexander

“…In this paper, we study quantum Ordered Binary Decision Diagrams( OBDD ) model; it is a restricted version of read-once quantum branching programs, with respect to “width” complexity…”
Get full text

On the computational complexity of membrane systems by Ibarra, Oscar H.

“… We define space and time complexity measures and show hierarchies of complexity classes similar to well-known results concerning Turing machines and counter machines…”
Get full text

Depth-two P systems can simulate Turing machines with NP oracles by Leporati, Alberto, Manzoni, Luca, Mauri, Giancarlo, Zandron, Claudio

“…•This model uses evolution, communication, dissolution, and (weak) membrane division rules.•We prove that these P systems compute at least all problems in the complexity class…”
Get full text