1308 search results - page 71 / 262 » Let's Have a Conversation |
148
click to vote
TABLEAUX
1998
Springer
15 years 10 months ago
1998
Springer
We present a framework for eliminating redundancies during the reconstruction of sequent proofs from matrix proofs. We show that search-free proof reconstruction requires knowledge...
135
click to vote
ASPDAC
2000
ACM
15 years 10 months ago
2000
ACM
We present a satisfiability based multi-clock path analysis method. The method uses propositional satisfiability (SAT) in the detection of multi-clock paths. We show a method to re...
177
click to vote
EUROCRYPT
2000
Springer
15 years 10 months ago
2000
Springer
We investigate the link between the nonlinearity of a Boolean function and its propagation characteristics. We prove that highly nonlinear functions usually have good propagation p...
151
click to vote
RECOMB
2000
Springer
15 years 10 months ago
2000
Springer
We present a general heuristicfor the median problem for induced breakpoints on genomes with unequal gene content and incorporate this into a routine for estimating optimal gene o...
159
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P/poly) is not measurable within exponential time, in...