Sciweavers

921 search results - page 52 / 185
» Expressing Computational Complexity in Constructive Type The...
Sort
View
CORR
1998
Springer
103views Education» more  CORR 1998»
13 years 7 months ago
The descriptive complexity approach to LOGCFL
Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclass...
Clemens Lautemann, Pierre McKenzie, Thomas Schwent...
POPL
2004
ACM
14 years 8 months ago
A bisimulation for dynamic sealing
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
Eijiro Sumii, Benjamin C. Pierce
IJCAI
2007
13 years 9 months ago
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
Electoral control refers to attempts by an election’s organizer (“the chair”) to influence the outcome by adding/deleting/partitioning voters or candidates. The groundbreak...
Edith Hemaspaandra, Lane A. Hemaspaandra, Jör...
SOFSEM
1999
Springer
14 years 3 days ago
Coherent Concepts, Robust Learning
We study learning scenarios in which multiple learners are involved and “nature” imposes some constraints that force the predictions of these learners to behave coherently. Thi...
Dan Roth, Dmitry Zelenko
ISSAC
2009
Springer
171views Mathematics» more  ISSAC 2009»
14 years 2 months ago
Computing cylindrical algebraic decomposition via triangular decomposition
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approache...
Changbo Chen, Marc Moreno Maza, Bican Xia, Lu Yang