Výsledky vyhledávání - Complexity Classes-complexity hierarchies*
-
1
Quantum and classical nondeterministic OBDDs
ISSN: 2541-7746, 2500-2198Vydáno: Kazan Federal University 22.12.2024Vydáno v Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki (22.12.2024)“… 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ískat plný text
Journal Article -
2
Refined Kolmogorov complexity of analog, evolving and stochastic recurrent neural networks
ISSN: 0020-0255Vydáno: Elsevier Inc 01.09.2025Vydáno v Information sciences (01.09.2025)“…, 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ískat plný text
Journal Article -
3
‘And You Need Me to Be the Token Mexican?’: Examining Racial Hierarchies and the Complexities of Racial Identities for Middle Class Mexican Americans
ISSN: 0896-9205, 1569-1632Vydáno: London, England SAGE Publications 01.07.2016Vydáno v Critical sociology (01.07.2016)“…This article examines the racial identities of middle class Mexican Americans, and provides a focus on how racial oppression plays a significant role in the…”
Získat plný text
Journal Article -
4
Reversal complexity revisited
ISSN: 0304-3975, 1879-2294Vydáno: Amsterdam Elsevier B.V 23.07.2008Vydáno v Theoretical computer science (23.07.2008)“…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ískat plný text
Journal Article -
5
Reachability in Vector Addition Systems is Ackermann-complete
ISSN: 2575-8454Vydáno: IEEE 01.02.2022Vydáno v Proceedings / annual Symposium on Foundations of Computer Science (01.02.2022)“…} is the k -th complexity class from the hierarchy of fast-growing complexity classes…”
Získat plný text
Konferenční příspěvek -
6
Completeness for the Complexity Class ∀∃R and Area-Universality
ISSN: 0179-5376, 1432-0444Vydáno: New York Springer US 01.07.2023Vydáno v Discrete & computational geometry (01.07.2023)“…, ∃ 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ískat plný text
Journal Article -
7
Parameterized complexity of weighted team definability
ISSN: 0960-1295, 1469-8072Vydáno: Cambridge, UK Cambridge University Press 01.05.2024Vydáno v Mathematical structures in computer science (01.05.2024)“…In this article, we study the complexity of weighted team definability for logics with team semantics…”
Získat plný text
Journal Article -
8
The parameterized space complexity of model-checking bounded variable first-order logic
ISSN: 1860-5974, 1860-5974Vydáno: Logical Methods in Computer Science e.V 01.01.2019Vydáno v Logical methods in computer science (01.01.2019)“… 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ískat plný text
Journal Article Publikace -
9
A Complexity Theory of Constructible Functions and Sheaves
ISSN: 1615-3375, 1615-3383Vydáno: Boston Springer US 01.02.2015Vydáno v Foundations of computational mathematics (01.02.2015)“…In this paper we introduce constructible analogs of the discrete complexity classes VP and VNP of sequences of functions…”
Získat plný text
Journal Article -
10
Minimax Games, Spin Glasses and the Polynomial-Time Hierarchy of Complexity Classes
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 10.12.1997Vydáno v arXiv.org (10.12.1997)“…We use the negative replica method, which was originally developed for the study of overfrustation in disordered system, to investigate the statistical…”
Získat plný text
Paper -
11
Dependence Logic with a Majority Quantifier
ISSN: 0925-8531, 1572-9583Vydáno: Dordrecht Springer 01.09.2015Vydáno v Journal of logic, language, and information (01.09.2015)“… Our results imply that, from the point of view of descriptive complexity theory, 𝓓(M) captures the complexity class counting hierarchy…”
Získat plný text
Journal Article -
12
Circuit complexity and functionality: A statistical thermodynamics perspective
ISSN: 1091-6490, 1091-6490Vydáno: United States 10.06.2025Vydáno v Proceedings of the National Academy of Sciences - PNAS (10.06.2025)“…Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science…”
Zjistit podrobnosti o přístupu
Journal Article -
13
More results on the complexity of identifying problems in graphs
ISSN: 0304-3975, 1879-2294Vydáno: Elsevier B.V 02.05.2016Vydáno v Theoretical computer science (02.05.2016)“… We locate these problems in the complexity classes of the polynomial hierarchy…”
Získat plný text
Journal Article -
14
On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics
ISSN: 1076-9757, 1076-9757, 1943-5037Vydáno: San Francisco AI Access Foundation 01.01.2021Vydáno v The Journal of artificial intelligence research (01.01.2021)“… We perform an exhaustive analysis of the computational complexity of these new, so-called naive-based semantics…”
Získat plný text
Journal Article -
15
Re-examining regular expressions with backreferences
ISSN: 0304-3975, 1879-2294, 1879-2294Vydáno: Elsevier B.V 09.01.2023Vydáno v Theoretical computer science (09.01.2023)“… 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ískat plný text
Journal Article -
16
Exponential separation between quantum and classical ordered binary decision diagrams, reordering method and hierarchies
ISSN: 1567-7818, 1572-9796Vydáno: Dordrecht Springer Netherlands 01.12.2023Vydáno v Natural computing (01.12.2023)“…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…”
Získat plný text
Journal Article -
17
On the computational complexity of membrane systems
ISSN: 0304-3975, 1879-2294Vydáno: Amsterdam Elsevier B.V 12.06.2004Vydáno v 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…”
Získat plný text
Journal Article -
18
Depth-two P systems can simulate Turing machines with NP oracles
ISSN: 0304-3975, 1879-2294Vydáno: Elsevier B.V 24.03.2022Vydáno v Theoretical computer science (24.03.2022)“…•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…”
Získat plný text
Journal Article -
19
On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
ISSN: 0304-3975, 1879-2294Vydáno: Oxford Elsevier B.V 06.11.2009Vydáno v Theoretical computer science (06.11.2009)“… In particular, we study complexity hierarchies and membership of the non-uniform class P/poly . We prove: 1…”
Získat plný text
Journal Article -
20
Who did what to whom? The neural basis of argument hierarchies during language comprehension
ISSN: 1053-8119, 1095-9572Vydáno: United States Elsevier Inc 15.05.2005Vydáno v NeuroImage (Orlando, Fla.) (15.05.2005)“… the “Undergoer” of the event expressed by the verb. In order to identify the neural bases of argument hierarchy processing, we manipulated three factors known to influence the complexity of argument hierarchy construction in German, namely argument…”
Získat plný text
Journal Article