Sciweavers

1683 search results - page 129 / 337
» Game Theory Basics
Sort
View
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
16 years 5 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
TPHOL
2005
IEEE
15 years 10 months ago
A HOL Theory of Euclidean Space
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
John Harrison
ECCC
2008
168views more  ECCC 2008»
15 years 4 months ago
Algebrization: A New Barrier in Complexity Theory
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
Scott Aaronson, Avi Wigderson
TSP
2008
180views more  TSP 2008»
15 years 4 months ago
Algebraic Signal Processing Theory: Foundation and 1-D Time
This paper introduces a general and axiomatic approach to linear signal processing (SP) that we refer to as the algebraic signal processing theory (ASP). Basic to ASP is the linear...
Markus Püschel, José M. F. Moura
CORR
2004
Springer
176views Education» more  CORR 2004»
15 years 4 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard