Sciweavers

58 search results - page 4 / 12
» Mechanical Theorem Proving in Computational Geometry
Sort
View
CORR
2004
Springer
94views Education» more  CORR 2004»
13 years 5 months ago
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
Scott Aaronson
ACL2
2006
ACM
13 years 11 months ago
Soundness of the simply typed lambda calculus in ACL2
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
Sol Swords, William R. Cook
MKM
2007
Springer
13 years 12 months ago
Context Aware Calculation and Deduction
We address some aspects of a proposed system architecture for mathematical assistants, integrating calculations and deductions by common infrastructure within the Isabelle theorem ...
Amine Chaieb, Makarius Wenzel
CORR
2011
Springer
193views Education» more  CORR 2011»
13 years 23 days ago
Advice Coins for Classical and Quantum Computation
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
Scott Aaronson, Andrew Drucker
MICRO
2009
IEEE
129views Hardware» more  MICRO 2009»
14 years 12 days ago
Execution leases: a hardware-supported mechanism for enforcing strong non-interference
High assurance systems such as those found in aircraft controls and the financial industry are often required to handle a mix of tasks where some are niceties (such as the contro...
Mohit Tiwari, Xun Li, Hassan M. G. Wassel, Frederi...