Sciweavers

2479 search results - page 188 / 496
» Quantum complexity theory
Sort
View
DAM
2007
67views more  DAM 2007»
15 years 6 months ago
The state of SAT
The papers in this special issue originated at SAT 2001, the Fourth International Symposium on the Theory and Applications of Satisfiability Testing. This foreword reviews the cu...
Henry A. Kautz, Bart Selman
APAL
2005
119views more  APAL 2005»
15 years 6 months ago
Elementary arithmetic
Abstract. There is a very simple way in which the safe/normal variable discipline of Bellantoni-Cook recursion (1992) can be imposed on arithmetical theories like PA: quantify over...
Geoffrey E. Ostrin, Stanley S. Wainer
EATCS
2002
141views more  EATCS 2002»
15 years 6 months ago
Recent Developments in Explicit Constructions of Extractors
Extractors are functions which are able to "extract" random bits from arbitrary distributions which "contain" sufficient randomness. Explicit constructions of ...
Ronen Shaltiel
RECOMB
2010
Springer
15 years 4 months ago
Ultra-Perfect Sorting Scenarios
Abstract. Perfection has been used as a criteria to select rearrangement scenarios since 2004. However, there is a fundamental bias towards extant species in the original definitio...
Aïda Ouangraoua, Anne Bergeron, Krister M. Sw...
MOC
2010
15 years 1 months ago
Factorization with genus 2 curves
The elliptic curve method (ECM) is one of the best factorization methods available. It is possible to use hyperelliptic curves instead of elliptic curves but it is in theory slower...
Romain Cosset