Results 1 to 10 of about 50,223 (113)
On the Combinatorial Complexity of Approximating Polytopes [PDF]
Discrete and Computational Geometry, 2017 Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error parameter $\varepsilon > 0$, the objective is to determine a polytope of minimum combinatorial complexity whose
David M Mount +2 more
exaly +10 more sources
Combinatorial Complexity of Convex Sequences [PDF]
Discrete and Computational Geometry, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alex Iosevich
exaly +3 more sources
Simplicity and Complexity in Combinatorial Optimization. [PDF]
Entropy (Basel)Many problems in physics and computer science can be framed in terms of combinatorial optimization. Due to this, it is interesting and important to study theoretical aspects of such optimization. Here, we study connections between Kolmogorov complexity, optima, and optimization.
Dingle K, Hutter M.
europepmc +4 more sources
Analytical reduction of combinatorial complexity arising from multiple protein modification sites [PDF]
Journal of the Royal Society Interface, 2015 Marc Birtwistle
exaly +2 more sources
Combinatorial flexibility problems and their computational complexity
Electronic Notes in Discrete Mathematics, 2008 Abstract The concept of flexibility—originated in the context of heat exchanger networks—is associated with a substructure which guarantees the performance of the original structure, in a given range of possible states. We extend this concept to combinatorial optimization problems, and prove several computational complexity results in this new ...
Graciela Nasini
exaly +4 more sources
On the Extension Complexity of Combinatorial Polytopes [PDF]
Mathematical Programming, 2013 15 pages, 3 figures, 2 ...
David Avis, Hans Raj Tiwary
openaire +8 more sources
Combinatorial interpretation of Kolmogorov complexity [PDF]
Proceedings 15th Annual IEEE Conference on Computational Complexity, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andrei Romashchenko +2 more
openaire +4 more sources
Computational complexity of combinatorial surfaces [PDF]
Proceedings of the sixth annual symposium on Computational geometry - SCG '90, 1990 We investigate the computational problems associated with combinatorial surfaces. Specifically, we present an algorithm (based on the Brahana-Dehn-Heegaard approach) for transforming the polygonal schema of a closed triangulated surface into its canonical form in O(n log n) time, where n is the total number of vertices, edges and faces. We also give an
Vegter, Gert, Yap, Chee K.
openaire +2 more sources
Complexity of combinatorial market makers [PDF]
Proceedings of the 9th ACM conference on Electronic commerce, 2008 We analyze the computational complexity of market maker pricing algorithms for combinatorial prediction markets. We focus on Hanson's popular logarithmic market scoring rule market maker (LMSR). Our goal is to implicitly maintain correct LMSR prices across an exponentially large outcome space.
Yiling Chen 0001 +4 more
openaire +3 more sources
Combinatorial Laplacian of the Matching Complex [PDF]
The Electronic Journal of Combinatorics, 2002 A striking result of Bouc gives the decomposition of the representation of the symmetric group on the homology of the matching complex into irreducibles that are self-conjugate. We show how the combinatorial Laplacian can be used to give an elegant proof of this result. We also show that the spectrum of the Laplacian is integral.
Xun Dong, Michelle L. Wachs
openaire +3 more sources