polynomial time
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy
... the polynomial-time hierarchy (see [11, 12] for a recent survey on the topic of completeness and hard- ness of approximation in the polynomial-time ...
16
A Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems
... We show in this paper that this family of designs has a fundamental weakness which allows us to mount an efficient key-recovery attack on all known constructions based on MQQ. More precisely, we can recover a ...
19
Polynomial time algorithms for computing distances of Fuzzy Transition Systems
... provide polynomial-time algorithms to calculate the behavioural distances, in both the non- discounted and the discounted ...strongly polynomial in the former ...
14
OCTAL: Optimal Completion of gene trees in polynomial time
... We approach the challenge of adding missing species into gene trees by formulating the Optimal Tree Com- pletion problem, where we seek to add the missing spe- cies to a gene tree to minimize the distance (defined in ...
18
Fixed dimensional energy games are in pseudo polynomial time
... pseudo-polynomial time (see ...pseudo-polynomial time when the dimension is fixed (see ...pseudo- polynomial time required infinite memory strategies ...
13
Learning Factor Graphs in Polynomial Time and Sample Complexity
... in polynomial time and from a polynomial number of training examples, assuming that the data is generated by a network in this ...in polynomial time and sample ...
46
An improved polynomial time algorithm for computing the refined Buneman tree
... induce less than 1% incorrect edges [6, 18]); more importantly, because of the important constraints they impose on inferred edges, the corresponding tree can be computed in polynomial time, whereas most ...
12
Recovering short secret keys of RLCE in polynomial time
... We presented a polynomial time key-recovery attack based on a square code distinguisher against the public key encryption scheme RLCE. This attack allows us to break all the so- called odd ID parameters ...
20
Solving the Binary Linear Programming Model in Polynomial Time
... The paper presents a technique for solving the binary linear programming model in polynomial time. The general binary linear programming problem is transformed into a convex quadratic programming problem. ...
7
Consistent Feature Selection for Pattern Recognition in Polynomial Time
... for every S as required by (5), and is polynomial in n. Therefore this choice defines a polynomial- time, consistent wrapper algorithm Φ. Note that we need only verify the point-wise convergence (5) ...
24
Randomized Polynomial-Time Identity Testing for Noncommutative Circuits
... The above result does not yield an efficient randomized PIT for noncommutative circuits in general, as noncommutative circuits of size s can compute polynomials with a double- exponential (in s) number of monomials. As a ...
36
A Polynomial Time Dynamic Oracle for Non Projective Dependency Parsing
... duced by Attardi (2006) together with other, more complex transitions. The parser we define here is therefore more restrictive than Attardi (2006), meaning that it does not cover all the non-pro- jective trees that can ...
11
A polynomial time algorithm for reachability in branching VASS in dimension one
... lishing the P upper bound claimed in Theorem 2. In the first part, we consider a variation of the reachability problem in which we are only interested in reaching configurations that are sufficiently large and lie in a ...
14
Polynomial time solutions of computational problems in noncommutative-algebraic cryptography
... The paper is organized as follows. Section 2 introduces the Commutator KEP and the braid group. In Section 3, we eliminate a technical complexity theoretic obstacle. Section 4 applies a method of Cheon and Jun to reduce ...
20
Key Recovery for LWE in Polynomial Time
... In practice, for applications [LNV11, GLN12, BLN14, LLN14, BCNS14], LWE parameters are selected very conservatively due to the difficulty in analyzing their security, and are of course not vulnerable to our ...
16
General Polynomial Time Decomposition Algorithms
... In this paper we present an extension of (and an improvement on) this result. We first define the general notion of an α-rate certifying q-set and show (with a simplified analysis) that it basically fits the same purpose ...
19
A Polynomial Time Parsing Algorithm for TT MCTAG
... In this paper, we focus on TT-MCTAG (Lichte, 2007). So far, it has been shown that the univer- sal recognition problem for TT-MCTAG is NP- hard (Søgaard et al., 2007). A restriction on TT- MCTAG has been proposed in ...
9
Polynomial-Time, Semantically-Secure Encryption Achieving the Secrecy Capacity
... Introduced by Wyner, Csisz´ar and K¨ orner in the late seventies [34, 11], the wiretap channel is a setting where one aims to obtain information-theoretic security (privacy) of communicated data under the sole assumption ...
20
Non-Malleable Codes Against Bounded Polynomial Time Tampering
... any polynomial time procedure (including procedures that run in much more time than the PRG itself) and (b) such PRGs guarantee that the behavior of poly-time procedures is only negligibly ...
30
Polynomial time primality testing algorithm
... Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 2006 Polynomial time primality testing algorithm Takeshi Aoyama Follow this and additional work[r] ...
71