AF: Small:Tradeoffs among Measures in Computational and Proof Complexity
AF:小:计算和证明复杂性措施之间的权衡
基本信息
- 批准号:1217099
- 负责人:
- 金额:$ 44万
- 依托单位:
- 依托单位国家:美国
- 项目类别:Standard Grant
- 财政年份:2012
- 资助国家:美国
- 起止时间:2012-08-01 至 2016-07-31
- 项目状态:已结题
- 来源:
- 关键词:
项目摘要
In this project, the PI and his team study the relationship between widely-used satisfiability algorithms (SAT solvers) and the complexity of proofs, with the goal of characterizing the proof strength of complete SAT solvers that use conflict-directed clause learning. The project also focuses on the inherent tradeoffs between the running time and storage (space) required to derive proofs and the impact that this has on SAT solvers. SAT solvers are among the most important and useful tools in a wide range of applications, from finding solutions to problems under constraints to checking the correctness and safety of software and hardware systems where theirrole as methods of proof is required.This project will also explore resource tradeoffs inherent in solving specific computational problems such as computing order statistics and encoding data using good quality error-correcting codes that are resilient to worst-case errors. Such error-correcting codes are becoming increasingly important in a networked world in which adversaries may deliberately corrupt network traffic.
在这个项目中,PI及其团队研究了广泛使用的满足性算法(SAT求解器)与证明的复杂性之间的关系,目的是表征使用使用冲突定向子句学习的完整SAT求解器的证明强度。 该项目还重点关注运行时间和存储时间(空间)之间的固有权衡,以获得证据以及对SAT求解器的影响。 SAT solvers are among the most important and useful tools in a wide range of applications, from finding solutions to problems under constraints to checking the correctness and safety of software and hardware systems where theirrole as methods of proof is required.This project will also explore resource tradeoffs inherent in solving specific computational problems such as computing order statistics and encoding data using good quality error-correcting codes that are resilient to worst-case errors. 在对手可能故意破坏网络流量的网络世界中,这种错误纠正的代码变得越来越重要。
项目成果
期刊论文数量(0)
专著数量(0)
科研奖励数量(0)
会议论文数量(0)
专利数量(0)
数据更新时间:{{ journalArticles.updateTime }}
{{
item.title }}
{{ item.translation_title }}
- DOI:
{{ item.doi }} - 发表时间:
{{ item.publish_year }} - 期刊:
- 影响因子:{{ item.factor }}
- 作者:
{{ item.authors }} - 通讯作者:
{{ item.author }}
数据更新时间:{{ journalArticles.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ monograph.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ sciAawards.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ conferencePapers.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ patent.updateTime }}
Paul Beame其他文献
Paul Beame的其他文献
{{
item.title }}
{{ item.translation_title }}
- DOI:
{{ item.doi }} - 发表时间:
{{ item.publish_year }} - 期刊:
- 影响因子:{{ item.factor }}
- 作者:
{{ item.authors }} - 通讯作者:
{{ item.author }}
{{ truncateString('Paul Beame', 18)}}的其他基金
AF: Small: Complexity of Representations for Inference
AF:小:推理表示的复杂性
- 批准号:
2006359 - 财政年份:2020
- 资助金额:
$ 44万 - 项目类别:
Standard Grant
SHF: Small: Efficient Verification of Nonlinear Arithmetic
SHF:小型:非线性算术的高效验证
- 批准号:
1714593 - 财政年份:2017
- 资助金额:
$ 44万 - 项目类别:
Standard Grant
AF: Small: Communication and Resource Tradeoffs
AF:小:通信和资源权衡
- 批准号:
1524246 - 财政年份:2015
- 资助金额:
$ 44万 - 项目类别:
Standard Grant
AF: Large: Collaborative Research: Reliable Quantum Communication and Computation in the Presence of Noise
AF:大型:协作研究:噪声存在下的可靠量子通信和计算
- 批准号:
1111382 - 财政年份:2011
- 资助金额:
$ 44万 - 项目类别:
Continuing Grant
Travel Support for IEEE Symposium on Foundations of Computer Science (FOCS 2011)
IEEE 计算机科学基础研讨会 (FOCS 2011) 差旅支持
- 批准号:
1147364 - 财政年份:2011
- 资助金额:
$ 44万 - 项目类别:
Standard Grant
Travel Support for the Symposium on Foundations of Computer Science (FOCS 2010)
计算机科学基础研讨会 (FOCS 2010) 的差旅支持
- 批准号:
1049485 - 财政年份:2010
- 资助金额:
$ 44万 - 项目类别:
Standard Grant
AF: Small: Graph Isomorphism and Quantum Random Walks by Anyons
AF:小:图同构和任意子的量子随机游走
- 批准号:
0916400 - 财政年份:2009
- 资助金额:
$ 44万 - 项目类别:
Standard Grant
Semi-algebraic complexity and models for massive data set processing
海量数据集处理的半代数复杂性和模型
- 批准号:
0830626 - 财政年份:2008
- 资助金额:
$ 44万 - 项目类别:
Continuing Grant
Communication Complexity, Proof Complexity, and Approximation
通信复杂性、证明复杂性和近似
- 批准号:
0514870 - 财政年份:2005
- 资助金额:
$ 44万 - 项目类别:
Continuing Grant
ITR: Inference in AI, Verification, and Theory: A Unified Approach
ITR:人工智能推理、验证和理论:统一方法
- 批准号:
0219468 - 财政年份:2002
- 资助金额:
$ 44万 - 项目类别:
Continuing Grant
相似国自然基金
靶向Treg-FOXP3小分子抑制剂的筛选及其在肺癌免疫治疗中的作用和机制研究
- 批准号:32370966
- 批准年份:2023
- 资助金额:50 万元
- 项目类别:面上项目
化学小分子激活YAP诱导染色质可塑性促进心脏祖细胞重编程的表观遗传机制研究
- 批准号:82304478
- 批准年份:2023
- 资助金额:30 万元
- 项目类别:青年科学基金项目
靶向小胶质细胞的仿生甘草酸纳米颗粒构建及作用机制研究:脓毒症相关性脑病的治疗新策略
- 批准号:82302422
- 批准年份:2023
- 资助金额:30 万元
- 项目类别:青年科学基金项目
HMGB1/TLR4/Cathepsin B途径介导的小胶质细胞焦亡在新生大鼠缺氧缺血脑病中的作用与机制
- 批准号:82371712
- 批准年份:2023
- 资助金额:49 万元
- 项目类别:面上项目
小分子无半胱氨酸蛋白调控生防真菌杀虫活性的作用与机理
- 批准号:32372613
- 批准年份:2023
- 资助金额:50 万元
- 项目类别:面上项目
相似海外基金
Collaborative Research: RUI: The challenges of living small: functional tradeoffs in the vertebral bone structure of diminutive mammals
合作研究:RUI:小型生活的挑战:小型哺乳动物椎骨结构的功能权衡
- 批准号:
2223964 - 财政年份:2023
- 资助金额:
$ 44万 - 项目类别:
Standard Grant
Collaborative Research: RUI: The challenges of living small: functional tradeoffs in the vertebral bone structure of diminutive mammals
合作研究:RUI:小型生活的挑战:小型哺乳动物椎骨结构的功能权衡
- 批准号:
2223965 - 财政年份:2023
- 资助金额:
$ 44万 - 项目类别:
Standard Grant
SWIFT: SMALL: xNGRAN Navigating Spectral Utilization, LTE/WiFi Coexistence, and Cost Tradeoffs in Next Gen Radio Access Networks through Cross-Layer Design
SWIFT:小型:xNGRAN 通过跨层设计实现下一代无线接入网络中的频谱利用、LTE/WiFi 共存和成本权衡
- 批准号:
2030101 - 财政年份:2020
- 资助金额:
$ 44万 - 项目类别:
Standard Grant
CIF: Small: Fundamental Tradeoffs Between Communication Load and Storage Resources in Distributed systems
CIF:小:分布式系统中通信负载和存储资源之间的基本权衡
- 批准号:
1910309 - 财政年份:2019
- 资助金额:
$ 44万 - 项目类别:
Standard Grant
CNS Core: Small: Collaborative Research: Attaining the New Frontier of Spectral Efficiency with Tradeoffs in Computation Through Cloud Radio Access Networks
CNS 核心:小型:协作研究:通过云无线接入网络权衡计算实现频谱效率的新前沿
- 批准号:
1909186 - 财政年份:2019
- 资助金额:
$ 44万 - 项目类别:
Standard Grant