The following pages link to Computational Complexity (Q5320667):
Displaying 50 items.
- Query answering over inconsistent knowledge bases: a probabilistic approach (Q2084950) (← links)
- Computing the probability of getting infected: on the counting complexity of bootstrap percolation (Q2086726) (← links)
- Gardens of Eden in the game of life (Q2086742) (← links)
- Colored cut games (Q2087453) (← links)
- Computational complexity of problems for deterministic presentations of sofic shifts (Q2087461) (← links)
- Sensor scheduling design for complex networks under a distributed state estimation framework (Q2097790) (← links)
- Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner (Q2103031) (← links)
- Self-driven algorithm for solving supermodular \((\max,+)\) labeling problems based on subgradient descent (Q2103793) (← links)
- A sieve stochastic gradient descent estimator for online nonparametric regression in Sobolev ellipsoids (Q2105198) (← links)
- Liouville numbers and the computational complexity of changing bases (Q2106591) (← links)
- On the complexity of conversion between classic real number representations (Q2106593) (← links)
- PAC-learning gains of Turing machines over circuits and neural networks (Q2111729) (← links)
- Approximate NFA universality motivated by information theory (Q2112188) (← links)
- Mosaics of combinatorial designs for information-theoretic security (Q2115738) (← links)
- Lower bounds and hardness magnification for sublinear-time shrinking cellular automata (Q2117099) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- Hardness and optimality in QBF proof systems modulo NP (Q2118289) (← links)
- Analysis of periodic linear systems over finite fields with and without Floquet transform (Q2120447) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- On regularity of Max-CSPs and Min-CSPs (Q2122790) (← links)
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving (Q2124467) (← links)
- An overview of structural systems theory (Q2125521) (← links)
- Emergence of the fused spacetime from a continuum computing construct of reality (Q2125950) (← links)
- Constructing locally leakage-resilient linear secret-sharing schemes (Q2129019) (← links)
- On efficiency of notations for natural numbers (Q2143116) (← links)
- Completeness, approximability and exponential time results for counting problems with easy decision version (Q2143122) (← links)
- A logic of interactive proofs (Q2151405) (← links)
- Between Turing and Kleene (Q2151416) (← links)
- A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
- On the decidability of infix inclusion problem (Q2163987) (← links)
- On the complexity of finding shortest variable disjunction branch-and-bound proofs (Q2164707) (← links)
- Real-time, constant-space, constant-randomness verifiers (Q2164756) (← links)
- Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields (Q2167518) (← links)
- Depth-first search in directed planar graphs, revisited (Q2170277) (← links)
- Accelerating deep learning with memcomputing (Q2182923) (← links)
- Constant work-space algorithms for facility location problems (Q2192101) (← links)
- Strong continuous non-malleable encoding schemes with tamper-detection (Q2195381) (← links)
- On NP-hard graph properties characterized by the spectrum (Q2197466) (← links)
- On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization (Q2199619) (← links)
- Robust classification via MOM minimization (Q2203337) (← links)
- Narrow big data in a stream: computational limitations and regression (Q2215116) (← links)
- A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
- A hierarchy of local decision (Q2219059) (← links)
- On the number of integer points in translated and expanded polyhedra (Q2227240) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- First-order rewritability of ontology-mediated queries in linear temporal logic (Q2238711) (← links)
- Committing to correlated strategies with multiple leaders (Q2238721) (← links)
- Hamiltonicity via cohomology of right-angled Artin groups (Q2238863) (← links)
- The complexities of nonperturbative computations (Q2239363) (← links)
- Lee-Yang theorems and the complexity of computing averages (Q2249768) (← links)
