6142 search results - page 165 / 1229 » The Complexity of Partition Functions |
142
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
114
click to vote
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
139
click to vote
ISAAC
1995
Springer
15 years 7 months ago
1995
Springer
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
109
click to vote
DAGSTUHL
2007
15 years 4 months ago
2007
We present classical simulation techniques for measure once quantum branching programs. For bounded error syntactic quantum branching program of width w that computes a function w...
100
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...