scientific article; zbMATH DE number 3917710
From MaRDI portal
Publication:3692867
Recommendations
- Uniform characterizations of non-uniform complexity measures
- Nonuniform complexity classes specified by lower and upper bounds
- Asymptotical behaviour of some non-uniform measures
- Two complexity measures for context-free languages
- Nonuniform complexity and the randomness of certain complete languages
Cited in
(48)- Inequality of finite behaviors of rational weight finite automata is in R
- Optical computing
- Nonuniform complexity and the randomness of certain complete languages
- Separating complexity classes with tally oracles
- On polynomial time one-truth-table reducibility to a sparse set
- A survey of space complexity
- Logarithmic advice classes
- A uniform approach to define complexity classes
- Two \(P\)-complete problems in the theory of the reals
- On sparse hard sets for counting classes
- On the complexity of sums of Dirichlet measures
- Relating polynomial time to constant depth
- The structure of logarithmic advice complexity classes
- Elimination of parameters in the polynomial hierarchy
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
- Analog computation via neural networks
- 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
- Alternation on cellular automata
- Algorithmic complexity of recursive and inductive algorithms
- Experience, generations, and limits in machine learning
- On hard instances
- Analog computation with dynamical systems
- An optical model of computation
- Fast computation of discrete invariants associated to a differential rational mapping
- On the lattices of NP-subspaces of a polynomial time vector space over a finite field
- Proof system representations of degrees of disjoint NP-pairs
- Self-reducibility
- A refinement of Cauchy-Schwarz complexity
- Uniform characterizations of non-uniform complexity measures
- scientific article; zbMATH DE number 4041256 (Why is no real title available?)
- Asymptotical behaviour of some non-uniform measures
- Nonuniform complexity classes specified by lower and upper bounds
- Shiner–Davison–Landsberg complexity revisited
- On the Complexity of Computing Two Nonlinearity Measures
- scientific article; zbMATH DE number 7301306 (Why is no real title available?)
- A Unified View on Sequence Complexity Measures as Isometries
- Minimal cover-automata for finite languages
- Knapsack problems for NL
- A note on P-selective sets and closeness
- On the power of several queues
- Probabilistic polynomial time is closed under parity reductions
- Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes
- Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions
- Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3692867)
