Towards applying computational complexity to foundations of physics.
Kreinovich, V., Finkelstein, A.M. (2004)
Zapiski Nauchnykh Seminarov POMI
Similarity:
Displaying similar documents to “Several methods of the reduction of computational complexity.”
Towards applying computational complexity to foundations of physics.
Computational experiments with some approximation algorithms for the travelling salesman problem
A. Adrabiński, M. M. Sysło (1983)
Applicationes Mathematicae
Similarity:
Higher-Dimensional Voronoi Diagrams in Linear Expected Time.
R.A. Dwyer (1991)
Discrete & computational geometry
Similarity:
A Geometric Inequality and the Complexity of Computing Volume.
G. Elekes (1986)
Discrete & computational geometry
Similarity:
The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.
H. Edelsbrunner, Micha Sharir, Leonidas J. Guibas (1989)
Discrete & computational geometry
Similarity:
Recent developments in computational gene recognition.
Batzoglou, Serafim, Berger, Bonnie, Kleitman, Daniel J., Lander, Eric, Pachter, Lior (1998)
Documenta Mathematica
Similarity:
Algorithms for Ham Sandwich Cuts.
J. Matousek, W. Steiger, Chi-Yuan Lo (1994)
Discrete & computational geometry
Similarity:
Probabilistic verification of proofs.
Sudan, Madhu (1998)
Documenta Mathematica
Similarity:
Partitioning Arrangements of Lines, I: An Efficient Deterministic Algorithm.
P.K. Agarwal (1990)
Discrete & computational geometry
Similarity:
Computability and Complexity of Ray Tracing.
J.H. Reif, J.D. Tygar, A. Yoshida (1994)
Discrete & computational geometry
Similarity:
Algorithms 56-59. Cluster analysis by the methods of Hubert
J. Kucharczyk (1978)
Applicationes Mathematicae
Similarity:
On Lazy Randomized Incremental Construction.
O. Schwarzkopf, M. de Berg, K. Dobrindt (1995)
Discrete & computational geometry
Similarity:
On the Complexity of Polyhedral Separability.
N. Megiddo (1988)
Discrete & computational geometry
Similarity: