Výsledky vyhľadávania - Complexity Classes-complexity hierarchies

Logical Foundations of Proof Complexity Autor 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…”
Získať plný text

Quantum and classical nondeterministic OBDDs Autor 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…”
Získať plný text

Refined Kolmogorov complexity of analog, evolving and stochastic recurrent neural networks Autor 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…”
Získať plný text

Cognitive Weighted Inherited Class Complexity Metric Autor 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…”
Získať plný text

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

“… This research concludes that these middle class Mexican Americans utilize different identity practices to navigate racism and racial hierarchies…”
Získať plný text

Reversal complexity revisited Autor 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 )…”
Získať plný text

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

“…} is the k -th complexity class from the hierarchy of fast-growing complexity classes…”
Získať plný text

Completeness for the Complexity Class ∀∃R and Area-Universality Autor 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…”
Získať plný text

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

“…In this article, we study the complexity of weighted team definability for logics with team semantics…”
Získať plný text

Structural Risk Minimization for Learning Nonlinear Dynamics Autor Stamouli, Charis, Chatzipantazis, Evangelos, Pappas, George J.

“…) for learning nonlinear dynamics. Inspired by classical SRM for classification, we minimize a bound on the true prediction error over hierarchies of model classes…”
Získať plný text

Structural Risk Minimization for Learning Nonlinear Dynamics Autor Stamouli, Charis, Chatzipantazis, Evangelos, Pappas, George J

“…) for learning nonlinear dynamics. Inspired by classical SRM for classification, we minimize a bound on the true prediction error over hierarchies of model classes…”
Získať plný text

The parameterized space complexity of model-checking bounded variable first-order logic Autor 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…”
Získať plný text

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

“…In this paper we introduce constructible analogs of the discrete complexity classes VP and VNP of sequences of functions…”
Získať plný text

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

“…We use the negative replica method, which was originally developed for the study of overfrustation in disordered system, to investigate the statistical…”
Získať plný text

Packing Arc-Disjoint Cycles in Tournaments Autor Bessy, Stéphane, Bougeret, Marin, Krithika, R., Sahu, Abhishek, Saurabh, Saket, Thiebaut, Jocelyn, Zehavi, Meirav

Získať plný text

Dependence Logic with a Majority Quantifier Autor 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…”
Získať plný text

Circuit complexity and functionality: A statistical thermodynamics perspective Autor 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…”
Zistit podrobnosti o prístupe

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

“… We locate these problems in the complexity classes of the polynomial hierarchy…”
Získať plný text

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

“… We perform an exhaustive analysis of the computational complexity of these new, so-called naive-based semantics…”
Získať plný text

Re-examining regular expressions with backreferences Autor 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…”
Získať plný text