Sciweavers

110 search results - page 4 / 22
» Complex analysis in subsystems of second order arithmetic
Sort
View
AML
2011
204views Mathematics» more  AML 2011»
13 years 5 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 10 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
DAC
2002
ACM
14 years 11 months ago
Model composition for scheduling analysis in platform design
We present a compositional approach to analyze timing behavior of complex platforms with different scheduling strategies. The approach uses event interfacing in order to couple pr...
Kai Richter, Dirk Ziegenbein, Marek Jersak, Rolf E...
DBPL
1999
Springer
101views Database» more  DBPL 1999»
14 years 2 months ago
On the Power of Incremental Evaluation in SQL-Like Languages
We consider IES(SQL), the incremental evaluation system over an SQL-like language with grouping, arithmetics, and aggregation. We show that every second order query is in IES(SQL) ...
Leonid Libkin, Limsoon Wong
MICRO
2009
IEEE
168views Hardware» more  MICRO 2009»
14 years 5 months ago
Ordering decoupled metadata accesses in multiprocessors
Hardware support for dynamic analysis can minimize the performance overhead of useful applications such as security checks, debugging, and profiling. To eliminate implementation ...
Hari Kannan