Complexity Theory
From MaRDI portal
Cited in
(23)- Towards implementation of a generalized architecture for high-level quantum programming language
- Recovery strategies from major supply disruptions in single and multiple sourcing networks
- Computational complexity theory. Part 10. Transl. from the Russian.
- On the complexity of the correctness problem for non-zeroness test instruction sequences
- Equilibrium traffic flow assignment in a multi-subnet urban road network
- On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates
- An evolutionary algorithm for robust regression
- On the complexity of nonuniform wavelength-based machine
- Black-box complexity: advantages of memory usage
- Classification of planar upward embedding
- Black-box complexity for bounding the performance of randomized search heuristics
- A sprouting tree model for random boolean functions
- Complexity and the big bang
- Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
- Improving quantum computation by optimized qubit routing
- Weighted Mutation of Connections To Mitigate Search Space Limitations in Cartesian Genetic Programming
- Precision, local search and unimodal functions
- The \textsc{maximum zero-sum partition} problem
- The structure of emulations in classical spin models: modularity and universality
- Theory of interaction
- Biological computation of the solution to the quadratic assignment problem
- On the expressiveness of interaction
This page was built for publication: Complexity Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3156942)
