• No results found

Deterministic polynomial time algorithm

Exact Polynomial time Algorithm for the Clique Problem and P = NP for Clique Problem

Exact Polynomial time Algorithm for the Clique Problem and P = NP for Clique Problem

... Sweeper Algorithm”, a deterministic polynomial time algorithm for the problem of finding the maximum clique in an arbitrary undirected graph ...sweeper algorithm was made ...

5

Randomized Polynomial-Time Identity Testing for Noncommutative Circuits

Randomized Polynomial-Time Identity Testing for Noncommutative Circuits

... white-box polynomial-time deterministic PIT for ...Our algorithm combines some new structural results for +-regular circuits with known PIT results for noncommutative algebraic branching ...

36

A Polynomial Time Parsing Algorithm for TT MCTAG

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

P schemes and Deterministic Polynomial Factoring Over Finite Fields

P schemes and Deterministic Polynomial Factoring Over Finite Fields

... -scheme algorithm developed in this chapter, it is sufficient to choose m = 2 in order to completely factorize f ˜ mod p , leading to a polynomial-time factoring algorithm for such instances ...

292

On the Learnability of Shuffle Ideals

On the Learnability of Shuffle Ideals

... constant-depth, polynomial- size threshold formulas is efficiently reducible to the problem of PAC learning shuffle ...of polynomial-size threshold formulas of that depth are capable of computing iterated ...

19

Combinatorial auctions with verification are tractable

Combinatorial auctions with verification are tractable

... a deterministic truthful auction which would provide the best possible approximation guarantee in polynomial time, even if bidders are double-minded ...first deterministic truthful auctions ...

18

Designing deterministic polynomial space algorithms by color coding multivariate polynomials

Designing deterministic polynomial space algorithms by color coding multivariate polynomials

... Shortly afterwards, Bj¨orklund et al. [6] have transformed the ideas in [4] into a powerful technique to design randomized polynomial-space algorithms, referred to as narrow sieves. This technique is also based on ...

29

Algorithms for Extended Galois Field Generation and Calculation

Algorithms for Extended Galois Field Generation and Calculation

... The algorithm analysis shows that the proposed algorithm for finding primitive polynomial is faster than traditional polynomial search and when table operations in GF(p m ) are used the ...

7

Estimating the weight of metric minimum spanning trees in sublinear time

Estimating the weight of metric minimum spanning trees in sublinear time

... sublinear time that are often required for the analysis of massive data ...linear time, and often even linear-time algorithms may be too ...sublinear time are well known, for example, ...

20

Probabilistic & Statistical Methods in Cryptology   An Introduction by Selected Topics pdf

Probabilistic & Statistical Methods in Cryptology An Introduction by Selected Topics pdf

... the algorithm of encryption is known to the adversary (Eve) and that the only thing that is kept secret is the key, which normally is a bitsequence or a sequence of natural numbers or el- ements of a finite ring ...

159

Approximation Algorithms for Complex-Valued Ising Models on Bounded Degree Graphs

Approximation Algorithms for Complex-Valued Ising Models on Bounded Degree Graphs

... a polynomial-time algorithm for approximating certain output probability amplitudes of quantum circuits (Corollary ...This algorithm is based on the observation that complex-valued Ising model ...

12

A polynomial-time algorithm for a flow-shop batching problem with equal-length operations

A polynomial-time algorithm for a flow-shop batching problem with equal-length operations

... our algorithm is to calculate for each relevant level the corresponding oscillation ...the algorithm which takes care of both cases can be easily ...

35

Algorithm to Compute Sudoku Solution by Using Constraint Satisfaction and Permutation in Polynomial Time

Algorithm to Compute Sudoku Solution by Using Constraint Satisfaction and Permutation in Polynomial Time

... ABSTRACT: A standard Sudoku puzzle has a 9 x 9 grid which is to be filled with numbers 1-9 in such a way that the numbers are not repeated in individual row, column or the 9 mini-grids of 3 x 3. A partially filled grid ...

5

On scenario aggregation to approximate robust combinatorial optimization problems

On scenario aggregation to approximate robust combinatorial optimization problems

... In the first experiment, we investigate the influence of the aggregation scheme on so- lution quality and computation time. We start by solving the robust problem exactly using an IP formulation which contains one ...

12

Optinalysis: Isometric Isomorphism and Automorphism Through A Looking-Glass

Optinalysis: Isometric Isomorphism and Automorphism Through A Looking-Glass

... Measures of graph symmetry, similarity, and identity have been extensively studied in graph automorphism and isomorphism detection problems. Nevertheless, graph isomorphism detection remains an open (unsolved) problem ...

24

An adaptive polynomial based forward prediction algorithm for multi-actuator real-time dynamic substructuring

An adaptive polynomial based forward prediction algorithm for multi-actuator real-time dynamic substructuring

... computation time is restricted due to the real-time constraints and that the actuation devices used must have a high enough dynamic rating to achieve the desired ...

21

List-Decoding Multiplicity Codes

List-Decoding Multiplicity Codes

... degree polynomial, which is the case we are interested in, the very singular situation happens only when P(T ) also satisfies a certain related differential equation Q ∗ (T, P(T ),P 0 (T )) = ...

34

Refined Deterministic Algorithm for Biplane Construction

Refined Deterministic Algorithm for Biplane Construction

... this algorithm, the number f of vectors in the filter was optimized for all bi- plane parameters for which a complete classi- fication is ...the algorithm is measured and compared ( Figure 6 ) ...

8

multicast-ton.pdf

multicast-ton.pdf

... Theoretically, we show that it is highly unlikely that there exists a polynomial-time algorithm with a performance guarantee of constant times optimum cost, introduce metrics for mea[r] ...

11

Indistinguishability  Obfuscation  from  Compact  Functional  Encryption

Indistinguishability Obfuscation from Compact Functional Encryption

... running time of encryption algorithm has sublinear dependence on the function size, in fact, ...running time of the encryption algorithm on a message x must be at most poly(λ, |x|) · |f | 1− ...

57

Show all 10000 documents...

Related subjects