Sciweavers

29908 search results - page 491 / 5982
» On the Complexity of
Sort
View
LATA
2010
Springer
16 years 4 months ago
Complexity of the Satisfiability Problem for a Class of Propositional Schemata
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
LATA
2010
Springer
16 years 4 months ago
Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
Neda Saeedloei and Gopal Gupta
ICS
2010
Tsinghua U.
16 years 4 months ago
Cryptographic Complexity Classes and Computational Intractability Assumptions
Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
16 years 4 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
SPAA
2009
ACM
16 years 4 months ago
On the complexity of the regenerator placement problem in optical networks
Michele Flammini, Alberto Marchetti-Spaccamela, Gi...