The following pages link to (Q3692867):
Displaying 45 items.
- Knapsack problems for NL (Q673615) (← links)
- A note on P-selective sets and closeness (Q673619) (← links)
- On the power of several queues (Q685436) (← links)
- Probabilistic polynomial time is closed under parity reductions (Q751270) (← links)
- Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes (Q809600) (← links)
- Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions (Q935140) (← links)
- Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources (Q974099) (← links)
- Inequality of finite behaviors of rational weight finite automata is in R (Q1014411) (← links)
- Optical computing (Q1036535) (← links)
- Nonuniform complexity and the randomness of certain complete languages (Q1184988) (← links)
- Separating complexity classes with tally oracles (Q1185002) (← links)
- On polynomial time one-truth-table reducibility to a sparse set (Q1191028) (← links)
- A survey of space complexity (Q1193412) (← links)
- Logarithmic advice classes (Q1193903) (← links)
- A uniform approach to define complexity classes (Q1200807) (← links)
- Two \(P\)-complete problems in the theory of the reals (Q1203649) (← links)
- On sparse hard sets for counting classes (Q1210293) (← links)
- On the complexity of sums of Dirichlet measures (Q1210518) (← links)
- Relating polynomial time to constant depth (Q1274992) (← links)
- The structure of logarithmic advice complexity classes (Q1275000) (← links)
- Elimination of parameters in the polynomial hierarchy (Q1285590) (← links)
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs (Q1295548) (← links)
- Analog computation via neural networks (Q1331940) (← links)
- Separation of complexity classes in Koiran's weak model (Q1338212) (← links)
- Computing over the reals with addition and order (Q1338216) (← links)
- On helping by parity-like languages (Q1349740) (← links)
- Geometric sets of low information content (Q1351460) (← links)
- Generalized Knapsack problems and fixed degree separations (Q1351965) (← links)
- Alternation on cellular automata (Q1390871) (← links)
- Algorithmic complexity of recursive and inductive algorithms (Q1434367) (← links)
- Experience, generations, and limits in machine learning (Q1434369) (← links)
- On hard instances (Q1575555) (← links)
- Analog computation with dynamical systems (Q1586961) (← links)
- An optical model of computation (Q1779303) (← links)
- Fast computation of discrete invariants associated to a differential rational mapping (Q1878484) (← links)
- On the lattices of NP-subspaces of a polynomial time vector space over a finite field (Q1923577) (← links)
- Proof system representations of degrees of disjoint NP-pairs (Q1944897) (← links)
- Self-reducibility (Q2639637) (← links)
- A refinement of Cauchy-Schwarz complexity (Q2674565) (← links)
- (Q3779737) (← links)
- Shiner–Davison–Landsberg complexity revisited (Q4968819) (← links)
- On the Complexity of Computing Two Nonlinearity Measures (Q4981157) (← links)
- (Q5146524) (← links)
- A Unified View on Sequence Complexity Measures as Isometries (Q5450821) (← links)
- Minimal cover-automata for finite languages (Q5958721) (← links)
