標(biāo)題: Titlebook: Computer Science -- Theory and Applications; 10th International C Lev D. Beklemishev,Daniil V. Musatov Conference proceedings 2015 Springer [打印本頁(yè)] 作者: interleukins 時(shí)間: 2025-3-21 16:59
書(shū)目名稱(chēng)Computer Science -- Theory and Applications影響因子(影響力)
書(shū)目名稱(chēng)Computer Science -- Theory and Applications影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Computer Science -- Theory and Applications網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Computer Science -- Theory and Applications網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Computer Science -- Theory and Applications被引頻次
書(shū)目名稱(chēng)Computer Science -- Theory and Applications被引頻次學(xué)科排名
書(shū)目名稱(chēng)Computer Science -- Theory and Applications年度引用
書(shū)目名稱(chēng)Computer Science -- Theory and Applications年度引用學(xué)科排名
書(shū)目名稱(chēng)Computer Science -- Theory and Applications讀者反饋
書(shū)目名稱(chēng)Computer Science -- Theory and Applications讀者反饋學(xué)科排名
作者: 無(wú)表情 時(shí)間: 2025-3-21 23:16
,-Completeness and Universal Hardness Results for Justification Logic,rom our previous work is tight. We then use a simple modification of the corresponding reduction to prove that satisfiability for all multi-agent justification logics from there is .-hard – given certain reasonable conditions. Our methods improve on these required conditions for the same lower bound作者: Abominate 時(shí)間: 2025-3-22 01:24 作者: Tonometry 時(shí)間: 2025-3-22 05:03 作者: 無(wú)所不知 時(shí)間: 2025-3-22 09:06
On Compiling Structured CNFs to OBDDs,t is, formulas with incidence graphs that are convex with respect to the set of variables) have polynomial OBDD size. Second, we prove an exponential lower bound on the OBDD size of a family of CNF formulas with incidence graphs of bounded degree..We obtain the first result by identifying a simple s作者: 體貼 時(shí)間: 2025-3-22 13:46
Satisfiability of ECTL* with Tree Constraints, the bounding quantifier (.). Here we apply this approach to concrete domains that are tree-like. We show that satisfiability of . with constraints is decidable over (i) semi-linear orders, (ii) ordinal trees (semi-linear orders where the branches form ordinals), and (iii) infinitely branching order作者: 體貼 時(shí)間: 2025-3-22 19:00
On Growth and Fluctuation of ,-Abelian Complexity,ticular aspects of this extension: First, how much the complexity can increase when moving from a level . to the next one. Second, how much the complexity of a given word can fluctuate. For both questions we give optimal solutions.作者: Incumbent 時(shí)間: 2025-3-23 00:53 作者: Peristalsis 時(shí)間: 2025-3-23 01:56
Editing to a Planar Graph of Given Degrees, ., together with three integers ., . and .. The question is whether we can delete a set of vertices of total weight at most . and a set of edges of total weight at most . so that the total cost of the deleted elements is at most . and every non-deleted vertex . has degree . in the resulting graph?.作者: optic-nerve 時(shí)間: 2025-3-23 07:30 作者: Unsaturated-Fat 時(shí)間: 2025-3-23 12:11 作者: INTER 時(shí)間: 2025-3-23 15:14
A Logical Characterization of Timed Pushdown Languages,In this paper, we introduce a quantitative logic on timed words which is expressively equivalent to timed pushdown automata. This logic is an extension of Wilke’s relative distance logic by quantitative matchings. To show the expressive equivalence result, we prove a decomposition theorem which esta作者: 體貼 時(shí)間: 2025-3-23 21:55
An In-Place Priority Queue with ,(1) Time for Push and , Comparisons for Pop,, . (.), and . (.-.). In this paper we introduce an in-place priority queue, for which . and . take .(1) worst-case time, and . takes . worst-case time and involves at most . element comparisons, where . denotes the number of elements currently in the data structure. The achieved bounds are optimal 作者: wreathe 時(shí)間: 2025-3-23 22:38
Resolution Complexity of Perfect Matching Principles for Sparse Graphs,nse graphs. We construct a constant degree bipartite graph . such that the resolution complexity of the perfect matching principle for . is ., where . is the number of vertices in .. This lower bound is tight up to some polynomial. Our result implies the . lower bounds for the complete graph . and t作者: infinite 時(shí)間: 2025-3-24 06:22 作者: guardianship 時(shí)間: 2025-3-24 10:26 作者: ectropion 時(shí)間: 2025-3-24 10:59 作者: 使無(wú)效 時(shí)間: 2025-3-24 17:35
Making Randomness Public in Unbounded-Round Information Complexity,d communication complexity . can be converted into a public-coin protocol with the same behavior so that it’s information complexity does not exceed .. “Same behavior” means that the transcripts of these two protocols are identically distributed on each pair of inputs. Such a conversion was previous作者: 搖晃 時(shí)間: 2025-3-24 19:29
Resolution Complexity of Perfect Matching Principles for Sparse Graphs,owing properties. There exists a constant . such that the degree of the .-th vertex is at least .(.) and at most ., and it is impossible to make all degrees equal to .(.) by removing the graph’s edges. Moreover, any proof of this statement in the resolution proof system has size .. This result impli作者: HACK 時(shí)間: 2025-3-25 02:01 作者: 流逝 時(shí)間: 2025-3-25 06:36
https://doi.org/10.1007/978-88-470-0513-6owing properties. There exists a constant . such that the degree of the .-th vertex is at least .(.) and at most ., and it is impossible to make all degrees equal to .(.) by removing the graph’s edges. Moreover, any proof of this statement in the resolution proof system has size .. This result impli作者: 啞劇 時(shí)間: 2025-3-25 09:42 作者: configuration 時(shí)間: 2025-3-25 13:16 作者: 合唱團(tuán) 時(shí)間: 2025-3-25 18:59
On Growth and Fluctuation of ,-Abelian Complexity,ticular aspects of this extension: First, how much the complexity can increase when moving from a level . to the next one. Second, how much the complexity of a given word can fluctuate. For both questions we give optimal solutions.作者: 同時(shí)發(fā)生 時(shí)間: 2025-3-25 23:46
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement,s diameter at most .. We provide a dynamic programming algorithm that solves this problem in polynomial time. . demonstrates several structural analogues to the celebrated and challenging . problem, where the resulting graph should, instead, be planar. The complexity status of this latter problem is open.作者: 真繁榮 時(shí)間: 2025-3-26 02:29
Conference proceedings 2015015..The 25 full papers presented in this volume were carefully reviewed and selected from 61 submissions. In addition the book contains 4 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas in theoretical computer science and its applications..作者: Harness 時(shí)間: 2025-3-26 04:28
https://doi.org/10.1007/978-3-319-20297-6Approximation algorithms; Computational complexity; Discrete mathematics; Formal grammars; Graph algorit作者: 緩和 時(shí)間: 2025-3-26 11:10
978-3-319-20296-9Springer International Publishing Switzerland 2015作者: 沒(méi)花的是打擾 時(shí)間: 2025-3-26 12:51 作者: 拱形面包 時(shí)間: 2025-3-26 19:41
Propositional Proofs in Frege and Extended Frege Systems (Abstract),We discuss recent results on the propositional proof complexity of Frege proof systems, including some recently discovered quasipolynomial size proofs for the pigeonhole principle and the Kneser-Lovász theorem. These are closely related to formalizability in bounded arithmetic.作者: constellation 時(shí)間: 2025-3-26 22:36
Numerical Methods for the Linear Model,s through a reformulation of a given query into a new one which can be answered without any use of theory. Thus the problem reduces to the standard database setting..However, the size of the query may increase substantially during the reformulation. In this survey we review a recently developed fram作者: freight 時(shí)間: 2025-3-27 01:30
Numerical Methods for the Linear Model,rom our previous work is tight. We then use a simple modification of the corresponding reduction to prove that satisfiability for all multi-agent justification logics from there is .-hard – given certain reasonable conditions. Our methods improve on these required conditions for the same lower bound作者: 開(kāi)頭 時(shí)間: 2025-3-27 08:14 作者: 喃喃而言 時(shí)間: 2025-3-27 10:27 作者: SOB 時(shí)間: 2025-3-27 17:11 作者: 翻布尋找 時(shí)間: 2025-3-27 21:01 作者: V切開(kāi) 時(shí)間: 2025-3-28 00:53 作者: expire 時(shí)間: 2025-3-28 05:47
Changhong Pei,Zhen Wang,Jingfang Suns diameter at most .. We provide a dynamic programming algorithm that solves this problem in polynomial time. . demonstrates several structural analogues to the celebrated and challenging . problem, where the resulting graph should, instead, be planar. The complexity status of this latter problem is作者: 小故事 時(shí)間: 2025-3-28 08:04
Changhong Pei,Zhen Wang,Jingfang Sun ., together with three integers ., . and .. The question is whether we can delete a set of vertices of total weight at most . and a set of edges of total weight at most . so that the total cost of the deleted elements is at most . and every non-deleted vertex . has degree . in the resulting graph?.作者: Antecedent 時(shí)間: 2025-3-28 14:16 作者: 無(wú)彈性 時(shí)間: 2025-3-28 18:09
General Aspects of External Fixation,e (DEXPTIME) whether a system of equations in idempotent variables over a free inverse monoid has a solution. The result is proved by a direct reduction to language equations with one-sided concatenation and a known complexity result by Baader and Narendran. Decidability for systems of typed equatio作者: 易碎 時(shí)間: 2025-3-28 19:59 作者: Dissonance 時(shí)間: 2025-3-29 02:12 作者: hemoglobin 時(shí)間: 2025-3-29 06:20
https://doi.org/10.1007/978-88-470-0513-6nse graphs. We construct a constant degree bipartite graph . such that the resolution complexity of the perfect matching principle for . is ., where . is the number of vertices in .. This lower bound is tight up to some polynomial. Our result implies the . lower bounds for the complete graph . and t作者: paradigm 時(shí)間: 2025-3-29 08:04 作者: Visual-Acuity 時(shí)間: 2025-3-29 15:27
GABA and the enteric nervous system,ell’s paradox. Russell introduced type theory to control the application of functions and avoid the paradox. Since, different type systems have been introduced, each allowing different functional power. Most of these systems use the two binders . and . to distinguish between functions and types, and作者: 混雜人 時(shí)間: 2025-3-29 17:45 作者: 腐爛 時(shí)間: 2025-3-29 21:09 作者: 殘酷的地方 時(shí)間: 2025-3-30 01:09
Computer Science -- Theory and Applications978-3-319-20297-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Cardioversion 時(shí)間: 2025-3-30 05:34
Changhong Pei,Chunxue Yang,Xinming Yangified faces of the graph, and the capacities and demands are integer-valued and Eulerian. It is known that such a problem has a solution if the cut and (2,3)-metric conditions hold, and that the solvability implies the existence of an integer solution. We develop a purely combinatorial strongly polynomial solution algorithm.作者: 草本植物 時(shí)間: 2025-3-30 08:15
Environmental History of Water Resources,ticular aspects of this extension: First, how much the complexity can increase when moving from a level . to the next one. Second, how much the complexity of a given word can fluctuate. For both questions we give optimal solutions.作者: eucalyptus 時(shí)間: 2025-3-30 12:40
Changhong Pei,Zhen Wang,Jingfang Suns diameter at most .. We provide a dynamic programming algorithm that solves this problem in polynomial time. . demonstrates several structural analogues to the celebrated and challenging . problem, where the resulting graph should, instead, be planar. The complexity status of this latter problem is open.作者: LUDE 時(shí)間: 2025-3-30 18:34
Lev D. Beklemishev,Daniil V. MusatovIncludes supplementary material: 作者: 極深 時(shí)間: 2025-3-31 00:13 作者: 效果 時(shí)間: 2025-3-31 00:58
Changhong Pei,Chunxue Yang,Xinming Yangsfy this condition. To prove the second result, we exploit the combinatorial properties of expander graphs; this approach allows us to establish an exponential lower bound on the OBDD size of formulas satisfying strong syntactic restrictions.作者: Solace 時(shí)間: 2025-3-31 07:32 作者: CRASS 時(shí)間: 2025-3-31 12:37
On Compiling Structured CNFs to OBDDs,sfy this condition. To prove the second result, we exploit the combinatorial properties of expander graphs; this approach allows us to establish an exponential lower bound on the OBDD size of formulas satisfying strong syntactic restrictions.作者: 阻塞 時(shí)間: 2025-3-31 13:52
On the Satisfiability of Quantum Circuits of Small Treewidth, for the complexity class QCMA, a quantum generalization of NP. In contrast, we show that the same problem is already NP-hard if . even when . is constant. Finally, we show that for . and constant ., it is QMA-hard to find a quantum witness . that maximizes the acceptance probability of a quantum circuit of treewidth . up?to a . additive factor.作者: 阻塞 時(shí)間: 2025-3-31 19:55
0302-9743 2015, held in Listvyanka, Russia, in July 2015..The 25 full papers presented in this volume were carefully reviewed and selected from 61 submissions. In addition the book contains 4 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas in theoretical comp作者: Sarcoma 時(shí)間: 2025-3-31 22:41 作者: Frenetic 時(shí)間: 2025-4-1 04:46
Numerical Methods for the Linear Model,ification logics from there is .-hard – given certain reasonable conditions. Our methods improve on these required conditions for the same lower bound for the single-agent justification logics, proven by Buss and Kuznets in 2009, thus answering one of their open questions.作者: 灰姑娘 時(shí)間: 2025-4-1 09:18
https://doi.org/10.1007/978-88-470-0513-6 tightness, we use a binary alphabet in the case of boolean operations and reversal, and an alphabet that grows exponentially for the remaining operations. However, we also provide exponential lower bounds for these operations using a fixed alphabet.作者: 火海 時(shí)間: 2025-4-1 13:23
Wulf Schiefenh?vel,Eckart Volandrid of the non-uniform advice, we supply the inputs with the probability threshold that we use to determine the acceptance. This technique was used by Pervyshev (2007) for proving a time hierarchy for heuristic computations.作者: expire 時(shí)間: 2025-4-1 16:34
Biomedical Science in an Expectant Society,. “Same behavior” means that the transcripts of these two protocols are identically distributed on each pair of inputs. Such a conversion was previously known only for one-way protocols. Our result provides a new proof for the best-known compression theorem in Information Complexity.
