The following pages link to Computational Complexity (Q5320667):
Displaying 50 items.
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- Computational complexity in the design of voting rules (Q256771) (← links)
- Chromatic kernel and its applications (Q266072) (← links)
- Regularity properties for sparse regression (Q279682) (← links)
- Concurrent phenomena at the reaction path of the \(S_{\mathrm N}2\) reaction \(\mathrm{CH}_3\mathrm{Cl}+F^-\). Information planes and statistical complexity analysis (Q280609) (← links)
- Reverse complexity (Q287279) (← links)
- A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding (Q290854) (← links)
- AND-compression of NP-complete problems: streamlined proof and minor observations (Q309801) (← links)
- On regular realizability problems for context-free languages (Q327306) (← links)
- The VC-dimension of graphs with respect to \(k\)-connected subgraphs (Q335348) (← links)
- Correlation bounds and \#SAT algorithms for small linear-size circuits (Q344759) (← links)
- Is Valiant-Vazirani's isolation probability improvable? (Q354652) (← links)
- First characterization of a new method for numerically solving the Dirichlet problem of the two-dimensional electrical impedance equation (Q364407) (← links)
- On regular realizability problems (Q375967) (← links)
- A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module (Q376132) (← links)
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- Critical sets for Sudoku and general graph colorings (Q393178) (← links)
- List-homomorphism problems on graphs and arc consistency (Q393914) (← links)
- Pseudorandom generators for \(\mathrm{CC}^0[p]\) and the Fourier spectrum of low-degree polynomials over finite fields (Q395606) (← links)
- Computing a visibility polygon using few variables (Q396475) (← links)
- A complementarity-based rolling friction model for rigid contacts (Q400139) (← links)
- Linear algebraic methods in communication complexity (Q417541) (← links)
- On derandomization and average-case complexity of monotone functions (Q428873) (← links)
- Space complexity of perfect matching in bounded genus bipartite graphs (Q439936) (← links)
- Information-theoretical complexity for the hydrogenic identity \(S_N2\) exchange reaction (Q445421) (← links)
- Derandomization in game-theoretic probability (Q468727) (← links)
- Generalized counting constraint satisfaction problems with determinantal circuits (Q472444) (← links)
- Temporal logics for concurrent recursive programs: satisfiability and model checking (Q472794) (← links)
- Computational complexity of threshold automata networks under different updating schemes (Q475388) (← links)
- A one-step worst-case optimal algorithm for bi-objective univariate optimization (Q476260) (← links)
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition (Q479466) (← links)
- Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
- On uniformity and circuit lower bounds (Q488049) (← links)
- Review of real-time vehicle schedule recovery methods in transportation services (Q490374) (← links)
- The complexity of debate checking (Q493647) (← links)
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- Verifying time complexity of Turing machines (Q496007) (← links)
- Quantum digital-to-analog conversion algorithm using decoherence (Q496934) (← links)
- Application of distributed semi-quantum computing model in phase estimation (Q506164) (← links)
- On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data (Q508691) (← links)
- On minimum maximal distance-\(k\) matchings (Q509288) (← links)
- The real nonnegative inverse eigenvalue problem is NP-hard (Q518113) (← links)
- The complexity of finding effectors (Q519899) (← links)
- Log-space conjugacy problem in the Grigorchuk group (Q524647) (← links)
- Tableau systems for deontic action logics based on finite Boolean algebras, and their complexity (Q526730) (← links)
- Color-blind index in graphs of very low degree (Q528569) (← links)
- Hardness of embedding simplicial complexes in \(\mathbb R^d\) (Q621847) (← links)
- Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)