1686 search results - page 11 / 338 » Programs as polygraphs: computability and complexity |
97
Voted
ENTCS
2006
14 years 9 months ago
2006
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
DAGSTUHL
2007
14 years 11 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...
107
click to vote
ICDE
2012
IEEE
13 years 2 days ago
2012
IEEE
—Motion sensing input devices like Microsoft’s Kinect offer an alternative to traditional computer input devices like keyboards and mouses. Daily new applications using this in...
100
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
DAC
1998
ACM
15 years 10 months ago
1998
ACM
A C++ based programming environment for the design of complex high speed ASICs is presented. The design of a 75 Kgate DECT transceiver is used as a driver example. Compact descrip...