1368 search results - page 84 / 274 » Generalized Rook Polynomials |
131
click to vote
ECCC
2006
15 years 4 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
131
click to vote
STOC
1997
ACM
15 years 8 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
115
click to vote
DCC
2006
IEEE
16 years 4 months ago
2006
IEEE
We present a new characterization of semi-bent and bent quadratic functions on finite fields. First, we determine when a GF(2)-linear combination of Gold functions Tr(x2i +1 ) is ...
144
click to vote
COCO
2005
Springer
15 years 10 months ago
2005
Springer
Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of ...
133
Voted
AAAI
2004
15 years 5 months ago
2004
An odd cycle of a logic program is a simple cycle that has an odd number of negative edges in the dependency graph of the program. Similarly, an even cycle is one that has an even...