Amanote Research

Amanote Research

    RegisterSign In

A Game Characterisation of Tree-Like Q-Resolution Size

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-15579-1_38
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2015

Authors
Olaf BeyersdorffLeroy ChewKarteek Sreenivasaiah
Publisher

Springer International Publishing


Related search

Q&A: The Numbers Game

Nature
Multidisciplinary
2015English

A Characterisation of Simple Groups PSL (5, Q)

Bulletin of the Australian Mathematical Society
Mathematics
2002English

Improved Lower Bounds for Tree-Like Resolution Over Linear Inequalities

English

Betweenness Centrality of an Edge in Tree-Like Components With Finite Size

Journal of Physics A: Mathematical and Theoretical
StatisticsProbabilityNonlinear PhysicsSimulationMathematical PhysicsStatisticalModelingAstronomyPhysics
2010English

Disks on a Tree: Analysis of a Combinatorial Game

SIAM Journal on Discrete Mathematics
Mathematics
2005English

The Resolution Game: A Dual Selves Perspective

Games
UncertaintyApplied MathematicsStatisticsProbability
2011English

Probability-Based Game Tree Pruning

Journal of Algorithms
1990English

Background Modelling Using a Q-Tree Based Foreground Segmentation

Scalable Computing
Computer Science
2020English

“Truth Is Like a Vast Tree”

Metaphor and the Social World
LinguisticsLanguage
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy