On the public citation graph
The GOOGLE and XPRIZE award for how to use quantum computers practically: The problem of the "P" versus "NP" outputs of any quantum computer and the pathway for its resolving
0 signed · 226 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1097-0037(199812)32:4<263::aid-net3>3.0.co;2-qopenalex-snapshot
A branch-and-cut algorithm for the undirected selective traveling salesman problem
inferredcites →https://doi.org/10.1002/(sici)1097-4571(1999)50:11<1030::aid-asi9>3.0.co;2-kopenalex-snapshot
Postmodern information science and its ?journal?
inferredcites →https://doi.org/10.1002/(sici)1099-0526(199809/10)4:1<33::aid-cplx10>3.0.co;2-uopenalex-snapshot
On quantum algorithms
inferredcites →https://doi.org/10.1002/(sici)1520-6440(199909)82:9<52::aid-ecjc6>3.0.co;2-hopenalex-snapshot
Current-mode chaotic neuron circuit for the traveling salesman problem
inferredcites →https://doi.org/10.1002/(sici)1520-6440(200008)83:8<71::aid-ecjc8>3.0.co;2-copenalex-snapshot
Walsh transforms and efficient quantum algorithms
inferredcites →https://doi.org/10.1002/(sici)1520-6750(199609)43:6<797::aid-nav2>3.0.co;2-#openalex-snapshot
An exact solution approach for the time‐dependent traveling‐salesman problem
inferredcites →https://doi.org/10.1002/(sici)1520-6750(199909)46:6<654::aid-nav4>3.0.co;2-aopenalex-snapshot
Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
inferredcites →https://doi.org/10.1002/1097-0037(200009)36:2<69::aid-net1>3.0.co;2-qopenalex-snapshot
A polyhedral study of the asymmetric traveling salesman problem with time windows
inferredcites →https://doi.org/10.1002/1520-6440(200102)84:2<76::aid-ecjc9>3.0.co;2-oopenalex-snapshot
An efficient hybrid genetic algorithm for the traveling salesman problem
inferredcites →https://doi.org/10.1002/1521-3870(200101)47:1<67::aid-malq67>3.0.co;2-vopenalex-snapshot
On P Versus NP for Parameter-Free Programs Over Algebraic Structures
inferredcites →https://doi.org/10.1002/bewi.201001464openalex-snapshot
(Re)cognizing Postmodernity: Helps for Historians – of Science Especially
inferredcites →https://doi.org/10.1002/ecj.10313openalex-snapshot
Extended changing crossover operators to solve the traveling salesman problem
inferredcites →https://doi.org/10.1002/ecjb.10070openalex-snapshot
“Optimal” neural representation of higher order for traveling salesman problems
inferredcites →https://doi.org/10.1002/ecjc.1049openalex-snapshot
A simple quantum computer: Experimental realization of quantum computation algorithms with linear optics
inferredcites →https://doi.org/10.1002/malq.200310116openalex-snapshot
Fast quantum algorithms for handling probabilistic and interval uncertainty
inferredcites →https://doi.org/10.1002/nav.3800130202openalex-snapshot
Surveillance of multi‐component systems: A stochastic traveling salesman's problem
inferredcites →https://doi.org/10.1002/nav.3800300107openalex-snapshot
The traveling salesman problem: An update of research
inferredcites →https://doi.org/10.1002/net.10079openalex-snapshot
An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
inferredcites →https://doi.org/10.1002/net.10091openalex-snapshot
Reoptimizing the traveling salesman problem
inferredcites →https://doi.org/10.1002/net.1024openalex-snapshot
On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
inferredcites →https://doi.org/10.1002/net.1025openalex-snapshot
A polynomial algorithm for a constrained traveling salesman problem
inferredcites →https://doi.org/10.1002/net.20011openalex-snapshot
Solving the asymmetric traveling salesman problem with periodic constraints
inferredcites →https://doi.org/10.1002/net.20122openalex-snapshot
On extended formulations for the precedence constrained asymmetric traveling salesman problem
inferredcites →https://doi.org/10.1002/net.20214openalex-snapshot
The computational complexity of graph contractions I: Polynomially solvable and NP‐complete cases
inferredcites →https://doi.org/10.1002/net.20307openalex-snapshot
A branch‐and‐cut algorithm for the undirected prize collecting traveling salesman problem
inferredcites →https://doi.org/10.1002/net.20312openalex-snapshot
A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
inferredcites →https://doi.org/10.1002/net.20421openalex-snapshot
A multistart heuristic for the equality generalized traveling salesman problem
inferredcites →https://doi.org/10.1002/net.20454openalex-snapshot
Online traveling salesman problems with service flexibility
inferredcites →https://doi.org/10.1002/net.21459openalex-snapshot
A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
inferredcites →https://doi.org/10.1002/net.3230100302openalex-snapshot
Efficient special case algorithms for the n‐line planar traveling salesman problem
inferredcites →https://doi.org/10.1002/net.3230110109openalex-snapshot
A more compact formulation of the symmetric multiple traveling salesman problem with fixed charges
inferredcites →https://doi.org/10.1002/net.3230120103openalex-snapshot
On the worst‐case performance of some algorithms for the asymmetric traveling salesman problem
inferredcites →https://doi.org/10.1002/net.3230150407openalex-snapshot
A heuristic circulation‐network approach to solve the multi‐traveling salesman problem
inferredcites →https://doi.org/10.1002/net.3230190602openalex-snapshot
The prize collecting traveling salesman problem
inferredcites →https://doi.org/10.1002/net.3230200605openalex-snapshot
Time‐dependent traveling salesman problem–the deliveryman case
inferredcites →https://doi.org/10.1002/net.3230220106openalex-snapshot
The n‐line traveling salesman problem
inferredcites →https://doi.org/10.1002/net.3230220305openalex-snapshot
Special cases of traveling salesman and repairman problems with time windows
inferredcites →https://doi.org/10.1002/net.3230230202openalex-snapshot
The traveling salesman problem with cumulative costs
inferredcites →https://doi.org/10.1002/net.3230230706openalex-snapshot
A two‐commodity flow formulation for the traveling salesman and the makespan problems with time windows
inferredcites →https://doi.org/10.1002/net.3230260206openalex-snapshot
The symmetric generalized traveling salesman polytope
inferredcites →https://doi.org/10.1006/aama.2000.0699openalex-snapshot
On Quantum Algorithms for Noncommutative Hidden Subgroups
inferredcites →https://doi.org/10.1006/jcom.1994.1011openalex-snapshot
General Spacefilling Curve Heuristics and Limit Theory for the Traveling Salesman Problem
inferredcites →https://doi.org/10.1006/reli.1993.1011openalex-snapshot
A bit of a circus: Notes on postmodernity and new age
inferredcites →https://doi.org/10.1007/978-3-322-92110-9_6openalex-snapshot
Mathematische Grundlagen der Quantenmechanik
inferredcites →https://doi.org/10.1007/978-3-642-69965-8_23openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1007/bf00993486openalex-snapshot
Liberty and discipline: Making sense of postmodernity, or, once again, toward a sociohistorical understanding of modernity
inferredcites →https://doi.org/10.1007/bf01763970openalex-snapshot
Distribution of numbers with a prescribed number of distinct prime divisors
inferredcites →https://doi.org/10.1007/s00037-003-0181-zopenalex-snapshot
Deterministic polynomial-time quantum algorithms for Simon?s problem
inferredcites →https://doi.org/10.1007/s00220-006-0150-xopenalex-snapshot
Efficient Quantum Algorithms for Simulating Sparse Hamiltonians
inferredcites →https://doi.org/10.1007/s00224-006-1313-zopenalex-snapshot
Robust Polynomials and Quantum Algorithms
inferredcites →https://doi.org/10.1007/s00224-008-9118-xopenalex-snapshot
Quantum Algorithms for Matching Problems
inferredcites →https://doi.org/10.1007/s00450-006-0008-7openalex-snapshot
Quantum algorithms: A survey of some recent results
inferredcites →https://doi.org/10.1007/s00453-002-0975-4openalex-snapshot
Quantum Algorithms for Weighing Matrices and Quadratic Residues
inferredcites →https://doi.org/10.1007/s10474-012-0244-1openalex-snapshot
On the mantissa distribution of powers of natural and prime numbers
inferredcites →https://doi.org/10.1007/s10559-010-9267-1openalex-snapshot
On the computational security of quantum algorithms for transformation of information
inferredcites →https://doi.org/10.1007/s10701-016-0060-5openalex-snapshot
Quantum Teleportation and Grover’s Algorithm Without the Wavefunction
inferredcites →https://doi.org/10.1007/s10732-010-9136-0openalex-snapshot
Quantum-inspired evolutionary algorithms: a survey and empirical study
inferredcites →https://doi.org/10.1007/s10773-009-0143-6openalex-snapshot
Quantum Algorithms Know in Advance 50% of the Solution They Will Find in the Future
inferredcites →https://doi.org/10.1007/s11023-007-9057-3openalex-snapshot
Quantum Algorithms: Philosophical Lessons
inferredcites →https://doi.org/10.1007/s11047-009-9133-0openalex-snapshot
Algorithms on ensemble quantum computers
inferredcites →https://doi.org/10.1007/s11128-004-3878-2openalex-snapshot
Progress in Quantum Algorithms
inferredcites →https://doi.org/10.1007/s11128-005-0001-2openalex-snapshot
Improved Bounds on Quantum Learning Algorithms
inferredcites →https://doi.org/10.1007/s11128-007-0061-6openalex-snapshot
Quantum Algorithms for Learning and Testing Juntas
inferredcites →https://doi.org/10.1007/s11128-008-0090-9openalex-snapshot
Self-protected quantum algorithms based on quantum state tomography
inferredcites →https://doi.org/10.1007/s11128-009-0148-3openalex-snapshot
On zeros of exponential polynomials and quantum algorithms
inferredcites →https://doi.org/10.1007/s11128-015-1174-yopenalex-snapshot
Global versus local quantum correlations in the Grover search algorithm
inferredcites →https://doi.org/10.1007/s11192-009-0119-6openalex-snapshot
Transition to postmodern science—related scientometric data
inferredcites →https://doi.org/10.1007/s11390-005-0003-7openalex-snapshot
Parameterized Computation and Complexity: A New Approach Dealing with NP-Hardness
inferredcites →https://doi.org/10.1007/s11434-010-3039-1openalex-snapshot
Speeding up implementation for Shor’s factorization quantum algorithm
inferredcites →https://doi.org/10.1007/s12043-001-0130-9openalex-snapshot
Quantum entanglement and quantum computational algorithms
inferredcites →https://doi.org/10.1007/s12043-001-0131-8openalex-snapshot
Quantum algorithms and the genetic code
inferredcites →https://doi.org/10.1007/s40819-014-0014-6openalex-snapshot
Some Analytical and Computational Aspects of Prime Numbers, Prime Number Theorems and Distribution of Primes with Applications
inferredcites →https://doi.org/10.1016/0004-3702(95)00054-2openalex-snapshot
A study of complexity transitions on the asymmetric traveling salesman problem
inferredcites →https://doi.org/10.1016/0010-4655(96)00062-8openalex-snapshot
Searching for backbones — an efficient parallel algorithm for the traveling salesman problem
inferredcites →https://doi.org/10.1016/0020-0190(90)90082-9openalex-snapshot
On the complexity of test case generation for NP-hard problems
inferredcites →https://doi.org/10.1016/0020-0255(82)90055-xopenalex-snapshot
The optimum assignments and a new heuristic approach for the traveling salesman problem
inferredcites →https://doi.org/10.1016/0020-0255(93)90133-7openalex-snapshot
Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem
inferredcites →https://doi.org/10.1016/0022-314x(82)90030-0openalex-snapshot
Discrepancies in the distribution of prime numbers
inferredcites →https://doi.org/10.1016/0039-3681(90)90018-4openalex-snapshot
Postmodern? No, simply amodern! Steps towards an anthropology of science
inferredcites →https://doi.org/10.1016/0039-3681(92)90025-2openalex-snapshot
Is a postmodern philosophy of science possible?
inferredcites →https://doi.org/10.1016/0041-1647(72)90051-2openalex-snapshot
A heuristic algorithm for traveling salesman problems
inferredcites →https://doi.org/10.1016/0096-3003(87)90059-2openalex-snapshot
Some properties of the solution space of the N-city traveling-salesman problem
inferredcites →https://doi.org/10.1016/0166-218x(88)90057-1openalex-snapshot
On common edges in optimal solutions to traveling salesman and other optimization problems
inferredcites →https://doi.org/10.1016/0166-218x(91)90044-wopenalex-snapshot
Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
inferredcites →https://doi.org/10.1016/0166-218x(92)00033-iopenalex-snapshot
A parallel tabu search algorithm for large traveling salesman problems
inferredcites →https://doi.org/10.1016/0166-218x(93)90047-ropenalex-snapshot
Sequential and parallel local search for the time-constrained traveling salesman problem
inferredcites →https://doi.org/10.1016/0166-218x(93)90152-eopenalex-snapshot
An O(n) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices
inferredcites →https://doi.org/10.1016/0166-218x(93)90169-oopenalex-snapshot
The skeleton of the symmetric traveling salesman polytope
inferredcites →https://doi.org/10.1016/0166-218x(93)e0082-aopenalex-snapshot
Clique tree inequalities define facets of the asymmetric traveling salesman polytope
inferredcites →https://doi.org/10.1016/0166-218x(94)00037-eopenalex-snapshot
Ejection chains, reference structures and alternating path methods for traveling salesman problems
inferredcites →https://doi.org/10.1016/0166-218x(95)98954-yopenalex-snapshot
Complete linear descriptions of small asymmetric traveling salesman polytopes
inferredcites →https://doi.org/10.1016/0167-6377(85)90032-xopenalex-snapshot
An improved assignment lower bound for the euclidean traveling salesman problem
inferredcites →https://doi.org/10.1016/0167-6377(87)90002-2openalex-snapshot
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
inferredcites →https://doi.org/10.1016/0167-6377(89)90030-8openalex-snapshot
On the core of a traveling salesman cost allocation game
inferredcites →https://doi.org/10.1016/0167-6377(89)90038-2openalex-snapshot
Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem
inferredcites →https://doi.org/10.1016/0167-6377(90)90031-yopenalex-snapshot
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
inferredcites →https://doi.org/10.1016/0167-6377(90)90033-2openalex-snapshot
A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem
inferredcites →https://doi.org/10.1016/0167-6377(91)90029-oopenalex-snapshot
Convergent duality for the traveling salesman problem
inferredcites →https://doi.org/10.1016/0167-6377(91)90067-yopenalex-snapshot
A complete description of the traveling salesman polytope on 8 nodes
inferredcites →https://doi.org/10.1016/0167-739x(94)00059-nopenalex-snapshot
A parallel 2-opt algorithm for the Traveling Salesman Problem
inferredcites →https://doi.org/10.1016/0167-8116(93)90009-nopenalex-snapshot
Postmodernity: The age of marketing
inferredcites →https://doi.org/10.1016/0272-6963(82)90010-9openalex-snapshot
An experimental comparison of human schedulers and heuristic algorithms for the traveling salesman problem
inferredcites →https://doi.org/10.1016/0304-3975(81)90069-4openalex-snapshot
On the structure of sets in NP and other complexity classes
inferredcites →https://doi.org/10.1016/0304-3975(86)90031-9openalex-snapshot
Average polynomial time complexity of some NP-complete problems
inferredcites →https://doi.org/10.1016/0304-422x(88)90029-0openalex-snapshot
Postmodernity and criticism
inferredcites →https://doi.org/10.1016/0305-0548(75)90015-5openalex-snapshot
The clustered traveling salesman problem
inferredcites →https://doi.org/10.1016/0305-0548(78)90033-3openalex-snapshot
A search algorithm for the traveling salesman problem
inferredcites →https://doi.org/10.1016/0305-0548(80)90004-0openalex-snapshot
Using multidimensional scaling to solve traveling salesman and machine scheduling problems
inferredcites →https://doi.org/10.1016/0305-0548(92)90018-zopenalex-snapshot
A multiperiod traveling salesman problem: Heuristic algorithms
inferredcites →https://doi.org/10.1016/0305-0548(94)00031-3openalex-snapshot
A new heuristic for the period traveling salesman problem
inferredcites →https://doi.org/10.1016/0305-0548(94)90016-7openalex-snapshot
Tabu search performance on the symmetric traveling salesman problem
inferredcites →https://doi.org/10.1016/0305-0548(95)00017-gopenalex-snapshot
“Conscientious” neural nets for tour construction in the traveling salesman problem: the vigilant net
inferredcites →https://doi.org/10.1016/0305-0548(95)00036-4openalex-snapshot
The Traveling Salesman Problem with Backhauls
inferredcites →https://doi.org/10.1016/0306-4573(93)90006-yopenalex-snapshot
Information science: The study of postmodern knowledge usage
inferredcites →https://doi.org/10.1016/0307-904x(89)90022-xopenalex-snapshot
Reduction techniques providing initial groupings for Euclidean traveling salesman patching algorithms
inferredcites →https://doi.org/10.1016/0360-8352(94)90340-9openalex-snapshot
Crossover on intensive search and traveling salesman problem
inferredcites →https://doi.org/10.1016/0375-9601(92)90557-3openalex-snapshot
The landscape of the traveling salesman problem
inferredcites →https://doi.org/10.1016/0377-2217(78)90044-9openalex-snapshot
On the solutions of stochastic traveling salesman problems
inferredcites →https://doi.org/10.1016/0377-2217(82)90014-5openalex-snapshot
Probabilistic analysis of solving the assignment problem for the traveling salesman problem
inferredcites →https://doi.org/10.1016/0377-2217(82)90015-7openalex-snapshot
A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
inferredcites →https://doi.org/10.1016/0377-2217(85)90257-7openalex-snapshot
An algorithm for the traveling salesman problem with pickup and delivery customers
inferredcites →https://doi.org/10.1016/0377-2217(85)90309-1openalex-snapshot
The symmetric clustered traveling salesman problem
inferredcites →https://doi.org/10.1016/0377-2217(86)90188-8openalex-snapshot
On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem
inferredcites →https://doi.org/10.1016/0377-2217(89)90230-0openalex-snapshot
On the stochastic complexity of the asymmetric traveling salesman problem
inferredcites →https://doi.org/10.1016/0377-2217(89)90356-1openalex-snapshot
Constrained spanning trees and the traveling salesman problem
inferredcites →https://doi.org/10.1016/0377-2217(89)90470-0openalex-snapshot
Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem
inferredcites →https://doi.org/10.1016/0377-2217(90)90251-6openalex-snapshot
A note on dual solutions of the assignment problem in connection with the traveling salesman problem
inferredcites →https://doi.org/10.1016/0377-2217(91)90339-wopenalex-snapshot
Pyramidal tours and the traveling salesman problem
inferredcites →https://doi.org/10.1016/0377-2217(93)90096-6openalex-snapshot
Small and large TSP: Two polynomially solvable cases of the traveling salesman problem
inferredcites →https://doi.org/10.1016/0377-2217(93)90335-kopenalex-snapshot
The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
inferredcites →https://doi.org/10.1016/0378-4371(94)90212-7openalex-snapshot
Quantum Monte Carlo algorithms using coherent states
inferredcites →https://doi.org/10.1016/j.actaastro.2005.03.023openalex-snapshot
Using quantum computing algorithms in future satellite communication
inferredcites →https://doi.org/10.1016/j.amc.2006.12.012openalex-snapshot
On the metamathematics of the P vs. NP question
inferredcites →https://doi.org/10.1016/j.chaos.2007.10.017openalex-snapshot
The distribution of prime numbers: The solution comes from dynamical processes and genetic algorithms
inferredcites →https://doi.org/10.1016/j.cplett.2009.10.011openalex-snapshot
Molecular dynamics algorithms for quantum Monte Carlo methods
inferredcites →https://doi.org/10.1016/j.dam.2010.12.014openalex-snapshot
The P versus NP–complete dichotomy of some challenging problems in graph theory
inferredcites →https://doi.org/10.1016/j.dam.2013.03.002openalex-snapshot
Permuting operations on strings and the distribution of their prime numbers
inferredcites →https://doi.org/10.1016/j.ejor.2010.05.039openalex-snapshot
Using modifications to Grover’s Search algorithm for quantum global optimization
inferredcites →https://doi.org/10.1016/j.ipl.2005.08.003openalex-snapshot
On the P versus NP intersected with co-NP question in communication complexity
inferredcites →https://doi.org/10.1016/j.jco.2004.05.002openalex-snapshot
Randomized and quantum algorithms yield a speed-up for initial-value problems
inferredcites →https://doi.org/10.1016/j.jcss.2017.02.002openalex-snapshot
Parameterized complexity classes beyond para-NP
inferredcites →https://doi.org/10.1016/j.jmr.2005.08.004openalex-snapshot
Experimental implementation of local adiabatic evolution algorithms by an NMR quantum information processor
inferredcites →https://doi.org/10.1016/j.jnt.2017.08.039openalex-snapshot
Explicit estimates for the distribution of numbers free of large prime factors
inferredcites →https://doi.org/10.1016/j.matcom.2004.01.017openalex-snapshot
A geometrical approach to quantum holonomic computing algorithms
inferredcites →https://doi.org/10.1016/j.physa.2005.09.017openalex-snapshot
Type II quantum algorithms
inferredcites →https://doi.org/10.1016/j.physa.2011.09.018openalex-snapshot
On Grover’s search algorithm from a quantum information geometry viewpoint
inferredcites →https://doi.org/10.1016/j.physleta.2005.10.002openalex-snapshot
Reducing execution time of quantum algorithms by additional permutation gates
inferredcites →https://doi.org/10.1016/j.physleta.2006.06.014openalex-snapshot
Quantum algorithms for the hidden subgroup problem on some semi-direct product groups by reduction to Abelian cases
inferredcites →https://doi.org/10.1016/j.physleta.2006.11.024openalex-snapshot
Threshold quantum cryptograph based on Grover's algorithm
inferredcites →https://doi.org/10.1016/j.tcs.2006.11.026openalex-snapshot
Three “quantum” algorithms to solve 3-SAT
inferredcites →https://doi.org/10.1016/s0010-4655(02)00420-4openalex-snapshot
Physical quantum algorithms
inferredcites →https://doi.org/10.1016/s0019-9958(82)80084-3openalex-snapshot
Analogues of semirecursive sets and effective reducibilities to the study of NP complexity
inferredcites →https://doi.org/10.1016/s0020-0190(03)00254-0openalex-snapshot
Quantum zero-error algorithms cannot be composed
inferredcites →https://doi.org/10.1016/s0022-247x(02)00227-5openalex-snapshot
The universality of the quantum Fourier transform in forming the basis of quantum computing algorithms
inferredcites →https://doi.org/10.1016/s0304-3975(02)00830-7openalex-snapshot
On the complexity of intersecting finite state automata and NL versus NP
inferredcites →https://doi.org/10.1016/s0375-9601(02)00187-1openalex-snapshot
Solving a class of continuous global optimization problems using quantum algorithms
inferredcites →https://doi.org/10.1016/s0378-4371(97)00251-3openalex-snapshot
1/ƒ noise in the distribution of prime numbers
inferredcites →https://doi.org/10.1017/s0027763000007881openalex-snapshot
A note on the congruent distribution of the number of prime factors of natural numbers
inferredcites →https://doi.org/10.1017/s0036930600038667openalex-snapshot
A Theology of Chaos. An Experiment in Postmodern Theological Science
inferredcites →https://doi.org/10.1017/s1062798713000598openalex-snapshot
The P versus NP Problem from the Membrane Computing View
inferredcites →https://doi.org/10.1023/a:1005640828460openalex-snapshot
Feminist Politics in Postmodernity: Thinking Globally While Acting Locally
inferredcites →https://doi.org/10.1023/a:1019868924061openalex-snapshot
Quantum Algorithms for Highly Structured Search Problems
inferredcites →https://doi.org/10.1023/a:1024680908847openalex-snapshot
Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems
inferredcites →https://doi.org/10.1023/a:1027339220458openalex-snapshot
Quantum Algorithms in Hilbert Database
inferredcites →https://doi.org/10.1038/414883aopenalex-snapshot
Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
inferredcites →https://doi.org/10.1038/nature08121openalex-snapshot
Demonstration of two-qubit algorithms with a superconducting quantum processor
inferredcites →https://doi.org/10.1070/im2008v072n02abeh002400openalex-snapshot
On the distribution of prime denominators of the approximants for almost all real numbers
inferredcites →https://doi.org/10.1070/rm1990v045n05abeh002680openalex-snapshot
The distribution of prime numbers
inferredcites →https://doi.org/10.1080/00091383.1992.9937125openalex-snapshot
Science in a Postmodern World
inferredcites →https://doi.org/10.1080/00949658208810560openalex-snapshot
Algorithmic complexity: three NP - hard problems in computational statistics
inferredcites →https://doi.org/10.1080/02698590500249522openalex-snapshot
Against the Politics of Postmodern Philosophy of Science
inferredcites →https://doi.org/10.1080/07341510601092191openalex-snapshot
The Primacy of Science in Modernity, of Technology in Postmodernity, and of Ideology in the History of Technology
inferredcites →https://doi.org/10.1080/08873267.1990.9976873openalex-snapshot
Getting in touch: The metamethodology of a postmodern science of mental life.
inferredcites →https://doi.org/10.1080/095003400419933openalex-snapshot
The information role of entanglement and interference operators in Shor quantum algorithm gate dynamics
inferredcites →https://doi.org/10.1080/09505439109526302openalex-snapshot
Chaos and entropy: Metaphors in postmodern science and social theory
inferredcites →https://doi.org/10.1080/10848779608579639openalex-snapshot
Science and the Postmodern Crisis
inferredcites →https://doi.org/10.1090/s0273-0979-1982-15057-1openalex-snapshot
Elementary methods in the study of the distribution of prime numbers
inferredcites →https://doi.org/10.1103/physreva.60.2742openalex-snapshot
Grover’s quantum search algorithm for an arbitrary initial amplitude distribution
inferredcites →https://doi.org/10.1103/physreva.60.2746openalex-snapshot
Grover’s quantum searching algorithm is optimal
inferredcites →https://doi.org/10.1103/physreva.61.042307openalex-snapshot
Nonresonant effects in the implementation of the quantum Shor algorithm
inferredcites →https://doi.org/10.1103/physreva.62.052305openalex-snapshot
Using Grover’s quantum algorithm for searching actual databases
inferredcites →https://doi.org/10.1103/physreva.65.042311openalex-snapshot
Decoherence in Grover’s quantum algorithm: Perturbative approach
inferredcites →https://doi.org/10.1103/physreva.66.052314openalex-snapshot
Trade-offs in the quantum search algorithm
inferredcites →https://doi.org/10.1103/physreva.66.062301openalex-snapshot
Grover’s quantum search algorithm for an arbitrary initial mixed state
inferredcites →https://doi.org/10.1103/physreva.68.042328openalex-snapshot
Experimental requirements for Grover’s algorithm in optical quantum computation
inferredcites →https://doi.org/10.1103/physreva.71.032346openalex-snapshot
Collective decoherence of the superpositional entangled states in the quantum Shor algorithm
inferredcites →https://doi.org/10.1103/physreva.72.050306openalex-snapshot
Implementation of Grover’s quantum search algorithm in a scalable system
inferredcites →https://doi.org/10.1103/physreva.72.062308openalex-snapshot
Entangled quantum states generated by Shor’s factoring algorithm
inferredcites →https://doi.org/10.1103/physreva.73.022329openalex-snapshot
Exponential complexity of an adiabatic algorithm for an NP-complete problem
inferredcites →https://doi.org/10.1103/physreva.81.052306openalex-snapshot
Entanglement of periodic states, the quantum Fourier transform, and Shor’s factoring algorithm
inferredcites →https://doi.org/10.1103/physreva.82.012326openalex-snapshot
Quantum search algorithms on a regular lattice
inferredcites →https://doi.org/10.1103/physreva.96.012306openalex-snapshot
Factoring with qutrits: Shor's algorithm on ternary and metaplectic quantum architectures
inferredcites →https://doi.org/10.1103/physreva.98.062333openalex-snapshot
Variational learning of Grover's quantum search algorithm
inferredcites →https://doi.org/10.1103/physreve.89.022922openalex-snapshot
Nearest-neighbor-spacing distribution of prime numbers and quantum chaos
inferredcites →https://doi.org/10.1103/physrevlett.84.1615openalex-snapshot
Influence of Superpositional Wave Function Oscillations on Shor's Quantum Algorithm
inferredcites →https://doi.org/10.1111/1463-1652.00025openalex-snapshot
Eschatology, Anthropology and Postmodernity
inferredcites →https://doi.org/10.1111/j.1467-9744.2005.00664.xopenalex-snapshot
MAGIC, RELIGION, SCIENCE, TECHNOLOGY, AND ETHICS IN THE POSTMODERN WORLD
inferredcites →https://doi.org/10.1119/1.1359518openalex-snapshot
From Schrödinger’s equation to the quantum search algorithm
showing the first 200 of 226 · page through all 226
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.