Sciweavers

514 search results - page 21 / 103
» On the Structure of Valiant's Complexity Classes
Sort
View
LICS
2012
IEEE
11 years 11 months ago
Near Unanimity Constraints Have Bounded Pathwidth Duality
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
Libor Barto, Marcin Kozik, Ross Willard
ISLPED
2004
ACM
157views Hardware» more  ISLPED 2004»
14 years 2 months ago
4T-decay sensors: a new class of small, fast, robust, and low-power, temperature/leakage sensors
We present a novel temperature/leakage sensor, developed for high-speed, low-power, monitoring of processors and complex VLSI chips. The innovative idea is the use of 4T SRAM cell...
Stefanos Kaxiras, Polychronis Xekalakis
FOCS
1998
IEEE
14 years 26 days ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
SCHOLARPEDIA
2008
122views more  SCHOLARPEDIA 2008»
13 years 7 months ago
Calogero-Moser system
ABSTRACT. We discuss a special eigenstate of the quantized periodic CalogeroMoser system associated to a root system. This state has the property that its eigenfunctions, when rega...
Francesco Calogero
STOC
2010
ACM
168views Algorithms» more  STOC 2010»
14 years 6 months ago
Non-commutative circuits and the sum-of-squares problem
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
Pavel Hrubes, Avi Wigderson and Amir Yehudayoff