Results 51 to 60 of about 47,064 (164)
Polynomial-time algorithms from ineffective proofs [PDF]
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., 2003 We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of /spl Pi//sub 2//sup 0/-theorems in feasible analysis. By ineffective proof we mean a proof which involves the noncomputational principle weak Konig's lemma WKL, and by feasible analysis we mean Cook and Urquhart's system CPV/sup /spl omega// plus ...
openaire +1 more source
On relativized probabilistic polynomial time algorithms
Journal of the Mathematical Society of Japan, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
TANAKA, Hisao, KUDOH, Masafumi
openaire +2 more sources
Polynomial-Time Decomposition Algorithms for Support Vector Machines [PDF]
Machine Learning, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hush, Don, Scovel, Clint
openaire +1 more source
A Polynomial-Time Algorithm for Pliable Index Coding [PDF]
IEEE Transactions on Information Theory, 2016 In pliable index coding, we consider a server with $m$ messages and $n$ clients where each client has as side information a subset of the messages. We seek to minimize the number of broadcast transmissions, so that each client can recover any one unknown message she does not already have. Previous work has shown that the pliable index coding problem is
Linqi Song, Christina Fragouli
openaire +2 more sources
Polynomial Time and Parameterized Approximation Algorithms for Boxicity [PDF]
, 2012 The boxicity (cubicity) of a graph G, denoted by box(G) (respectively cub(G)), is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes (cubes) in ℝk. The problem of computing boxicity (cubicity) is known to be inapproximable in polynomial time even for graph classes like bipartite, co-bipartite and split
Adiga, Abhijin +2 more
openaire +2 more sources
The method of generation program code with indistinguishable functionality
Безопасность информационных технологий, 2017 The paper presents an obfuscation problem, in which indistinguishability is considered relatively to programs with distinguishable functionality. The functionality remains undisclosed owing to unknown parameters in the program’s input.
Mikhail Andreevich Styugin
doaj +1 more source
A Polynomial Time Algorithm for 3sat
By creating some new concepts and methods: checking tree, long unit path, direct contradiction unit pair, indirect contradiction unit pair, additional contradiction unit pair, 2-unit layer and 3-unit layer, redundant units, and destroying parallel pairs , we successfully transform solving a 3SAT problem to solving 2SAT problems in polynomial time. Thus
openaire +4 more sources
A polynomial time circle packing algorithm
Discrete Mathematics, 1993 A map on a surface \(S\) is a pair \((G,S)\) with \(G\) a graph which is 2-cell embedded in \(S\). A circle packing is a set of geodesic circles, with disjoint interiors, in a Riemannian surface \(S'\) of constant curvature. Connecting the midpoints of the circles with the touching points (with other circles or the same circle), one gets a graph on \(S'
openaire +1 more source
A Polynomial Time Algorithm for Unidimensional Unfolding Representations
Journal of Algorithms, 1994 Summary: Two conditions on a collection of simple orders -- unimodality and straightness -- are necessary but not jointly sufficient for unidimensional unfolding representations. From the analysis of these conditions, a polynomial time algorithm is derived for the testing of unidimensionality and for the construction of a representation when one exists.
Doignon, Jean-Paul +1 more
openaire +2 more sources
Polynomial-Time Approximation Algorithms for Weighted LCS Problem
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cygan, M. +4 more
openaire +1 more source