Sciweavers

5608 search results - page 195 / 1122
» On the Theory of Matchgate Computations
Sort
View
JSYML
2010
107views more  JSYML 2010»
15 years 9 days ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
16 years 2 months ago
Fast quantum algorithms for computing the unit group and class group of a number field
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...
Sean Hallgren
99
Voted
CIE
2007
Springer
15 years 5 months ago
Effective Computation for Nonlinear Systems
Nonlinear dynamical and control systems are an important source of applications for theories of computation over the the real numbers, since these systems are usually to complicate...
Pieter Collins
115
Voted
HICSS
2007
IEEE
138views Biometrics» more  HICSS 2007»
15 years 8 months ago
Online Education in Computer and Digital Forensics: A Case Study
Computer forensics is a relatively new, but growing, field of study at the undergraduate college and university level. This paper describes some of the course design aspects of te...
Gary C. Kessler
101
Voted
JUCS
2008
134views more  JUCS 2008»
15 years 1 months ago
Computability of Topological Pressure for Sofic Shifts with Applications in Statistical Physics
: The topological pressure of dynamical systems theory is examined from a computability theoretic point of view. It is shown that for sofic shift dynamical systems, the topological...
Christoph Spandl