Sciweavers

72 search results - page 12 / 15
» A note on a theorem of Ax
Sort
View
CORR
2010
Springer
154views Education» more  CORR 2010»
14 years 6 months ago
Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
Florian Richoux
JELIA
2004
Springer
15 years 3 months ago
Knowledge-Theoretic Properties of Strategic Voting
Abstract. Results in social choice theory such as the Arrow and GibbardSatterthwaite theorems constrain the existence of rational collective decision making procedures in groups of...
Samir Chopra, Eric Pacuit, Rohit Parikh
CDC
2009
IEEE
112views Control Systems» more  CDC 2009»
15 years 2 months ago
A Floquet-like factorization for linear periodic systems
In this note, the novel representation is proposed for a linear periodic continuous-time system with T-periodic real-valued coefficients. We prove that a T-periodic real-valued fac...
Ichiro Jikuya, Ichijo Hodaka
JCT
1998
193views more  JCT 1998»
14 years 9 months ago
Fractional Kernels in Digraphs
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
Ron Aharoni, Ron Holzman
ICCAD
2002
IEEE
142views Hardware» more  ICCAD 2002»
15 years 6 months ago
SAT and ATPG: Boolean engines for formal hardware verification
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
Armin Biere, Wolfgang Kunz