Sciweavers

5493 search results - page 3 / 1099
» Effectively Polynomial Simulations
Sort
View
ISCAS
2003
IEEE
101views Hardware» more  ISCAS 2003»
13 years 10 months ago
A 5th order Volterra study of a 30W LDMOS power amplifier
A 30 W LDMOS is modeled using a 5th order polynomial model. The polynomial model is compared to the largesignal MET model using harmonic balance, and as the results agreed very we...
Antti Heiskanen, Janne Aikio, Timo Rahkonen
TCC
2005
Springer
102views Cryptology» more  TCC 2005»
13 years 10 months ago
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs
The standard class of adversaries considered in cryptography is that of strict polynomial-time probabilistic machines. However, expected polynomial-time machines are often also co...
Jonathan Katz, Yehuda Lindell
ERSHOV
2001
Springer
13 years 9 months ago
Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called...
Jan Friso Groote, Hans Zantema
AMAI
2005
Springer
13 years 5 months ago
Resolution cannot polynomially simulate compressed-BFS
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...
DoRon B. Motter, Jarrod A. Roy, Igor L. Markov