Sciweavers

248 search results - page 48 / 50
» Circuit-based Boolean Reasoning
Sort
View
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
13 years 11 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...
AGP
2003
IEEE
13 years 11 months ago
Solving Hard Disjunctive Logic Programs Faster (Sometimes)
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assu...
Gerald Pfeifer
ISSTA
2010
ACM
13 years 10 months ago
Automated fixing of programs with contracts
In program debugging, finding a failing run is only the first step; what about correcting the fault? Can we automate the second task as well as the first? The AutoFix-E tool au...
Yi Wei, Yu Pei, Carlo A. Furia, Lucas S. Silva, St...
DATE
2006
IEEE
95views Hardware» more  DATE 2006»
13 years 10 months ago
Satisfiability-based framework for enabling side-channel attacks on cryptographic software
- Many electronic systems contain implementations of cryptographic algorithms in order to provide security. It is well known that cryptographic algorithms, irrespective of their th...
Nachiketh R. Potlapally, Anand Raghunathan, Srivat...
TREC
2008
13 years 7 months ago
TREC 2008 at the University at Buffalo: Legal and Blog Track
In the TREC 2008, the team from the State University of New York at Buffalo participated in the Legal track and the Blog track. For the Legal track, we worked on the interactive s...
Jianqiang Wang, Ying Sun, Omar Mukhtar, Rohini K. ...