scientific article
From MaRDI portal
Publication:3692867
zbMath0574.68039MaRDI QIDQ3692867
José L. Balcázar, Joaquim Gabarró, Josep Diaz
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Analog computation via neural networks, Fast computation of discrete invariants associated to a differential rational mapping, Separation of complexity classes in Koiran's weak model, Computing over the reals with addition and order, On helping by parity-like languages, Geometric sets of low information content, Generalized Knapsack problems and fixed degree separations, Self-reducibility, On the lattices of NP-subspaces of a polynomial time vector space over a finite field, Alternation on cellular automata, Proof system representations of degrees of disjoint NP-pairs, Algorithmic complexity of recursive and inductive algorithms, Experience, generations, and limits in machine learning, Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions, Nonuniform complexity and the randomness of certain complete languages, Separating complexity classes with tally oracles, Knapsack problems for NL, A note on P-selective sets and closeness, On polynomial time one-truth-table reducibility to a sparse set, A survey of space complexity, Logarithmic advice classes, On the power of several queues, A uniform approach to define complexity classes, Two \(P\)-complete problems in the theory of the reals, On sparse hard sets for counting classes, Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources, An optical model of computation, Minimal cover-automata for finite languages, Inequality of finite behaviors of rational weight finite automata is in R, Probabilistic polynomial time is closed under parity reductions, Relating polynomial time to constant depth, The structure of logarithmic advice complexity classes, Optical computing, Elimination of parameters in the polynomial hierarchy, On hard instances, An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs, Analog computation with dynamical systems, Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes
