2766 search results - page 78 / 554 » Algorithms for trigonometric polynomials |
125
click to vote
FCT
2007
Springer
15 years 4 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
75
Voted
COCO
2006
Springer
15 years 4 months ago
2006
Springer
We may believe SAT does not have small Boolean circuits. But is it possible that some language with small circuits looks indistiguishable from SAT to every polynomialtime bounded ...
91
Voted
AMAI
2005
Springer
15 years 21 days ago
2005
Springer
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...
83
Voted
IJNSEC
2010
14 years 7 months ago
2010
Orthomorphic permutations have important applications in the design of block ciphers. A practical algorithm is derived to generate all orthomorphic permutations over Fm 2 , and it...
DCFS
2011
14 years 17 days ago
2011
We prove Kleene theorems for two subclasses of labelled product systems which are inspired from well-studied subclasses of 1bounded Petri nets. For product T-systems we define a c...