Gotowe bibliografie tematyczne / Pigeonhole property

Spis treści

  1. Artykuły w czasopismach

Gotowa bibliografia na temat „Pigeonhole property”

Autor: Grafiati
Data publikacji: 3 czerwca 2025
Data aktualizacji: 31 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Pigeonhole property”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Pigeonhole property"

1

Bonato, Anthony, and Dejan Delić. "A Pigeonhole Property for Relational Structures." Mathematical Logic Quarterly 45, no. 3 (1999): 409–13. http://dx.doi.org/10.1002/malq.19990450311.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Bonato, Anthony, Peter Cameron, and Dejan Delić. "Tournaments and Orders with the Pigeonhole Property." Canadian Mathematical Bulletin 43, no. 4 (2000): 397–405. http://dx.doi.org/10.4153/cmb-2000-047-6.

Pełny tekst źródła
Streszczenie:
AbstractA binary structure S has the pigeonhole property (𝒫) if every finite partition of S induces a block isomorphic to S. We classify all countable tournaments with (𝒫); the class of orders with (𝒫) is completely classified.
Style APA, Harvard, Vancouver, ISO itp.
3

Paraoanu, G. "Non-Local Parity Measurements and the Quantum Pigeonhole Effect." Entropy 20, no. 8 (2018): 606. http://dx.doi.org/10.3390/e20080606.

Pełny tekst źródła
Streszczenie:
The pigeonhole principle upholds the idea that by ascribing to three different particles either one of two properties, we necessarily end up in a situation when at least two of the particles have the same property. In quantum physics, this principle is violated in experiments involving postselection of the particles in appropriately-chosen states. Here, we give two explicit constructions using standard gates and measurements that illustrate this fact. Intriguingly, the procedures described are manifestly non-local, which demonstrates that the correlations needed to observe the violation of thi
Style APA, Harvard, Vancouver, ISO itp.
4

Krajíček, Jan. "Structured pigeonhole principle, search problems and hard tautologies." Journal of Symbolic Logic 70, no. 2 (2005): 619–30. http://dx.doi.org/10.2178/jsl/1120224731.

Pełny tekst źródła
Streszczenie:
AbstractWe consider exponentially large finite relational structures (with the universe {0, 1}n) whose basic relations are computed by polynomial size (nO(1)) circuits. We study behaviour of such structures when pulled back by P/poly maps to a bigger or to a smaller universe. In particular, we prove that:1. If there exists a P/poly map g: {0, 1}n → {0, 1}m, n < m, iterable for a proof system then a tautology (independent of g) expressing that a particular size n set is dominating in a size 2n tournament is hard for the proof system.2. The search problem WPHP. decoding RSA or finding a colli
Style APA, Harvard, Vancouver, ISO itp.
5

Krajíček, Jan. "Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds." Journal of Symbolic Logic 69, no. 1 (2004): 265–86. http://dx.doi.org/10.2178/jsl/1080938841.

Pełny tekst źródła
Streszczenie:
AbstractThis article is a continuation of our search for tautologies that are hard even for strong propositional proof systems like EF. cf. [14, 15]. The particular tautologies we study, the τ-formulas. are obtained from any /poly map g; they express that a string is outside of the range of g, Maps g considered here are particular pseudorandom generators. The ultimate goal is to deduce the hardness of the τ-formulas for at least EF from some general, plausible computational hardness hypothesis.In this paper we introduce the notions of pseudo-surjective and iterable functions (related to free f
Style APA, Harvard, Vancouver, ISO itp.
6

SCHOUTENS, HANS. "O-MINIMALISM." Journal of Symbolic Logic 79, no. 2 (2014): 355–409. http://dx.doi.org/10.1017/jsl.2013.14.

Pełny tekst źródła
Streszczenie:
AbstractThis paper is devoted to o-minimalism, the study of the first-order properties of o-minimal structures. The main protagonists are the pseudo-o-minimal structures, that is to say, the models of the theory of all o-minimal L-structures, but we start with a more in-depth analysis of the well-known fragment DCTC (Definable Completeness/Type Completeness), and show how it already admits many of the properties of o-minimal structures: dimension theory, monotonicity, Hardy structures, and quasi-cell decomposition, provided one replaces finiteness by discreteness in all of these. Failure of ce
Style APA, Harvard, Vancouver, ISO itp.
7

Culbertson, Philip. "Working with Spiritual Difference, or "You Believe WHAT????"." New Zealand Journal of Counselling 33, no. 2 (2013): 1–11. http://dx.doi.org/10.24135/nzjc.v33i2.175.

Pełny tekst źródła
Streszczenie:
Issues of spirituality, defined here as those values and insights that give meaning to a client's daily life, are increasingly a part of what we must be prepared to deal with in the counselling room. Traditional religions, particularly Christianity and Judaism, are viewed by many clients as being too confining, devoid of spontaneity and imagination, and out of touch with the experiences of the young in particular. Working with spirituality in counselling relationships requires us to begin where our clients are, resisting any temptation to pigeonhole their search for meaning in their lives. Unl
Style APA, Harvard, Vancouver, ISO itp.
8

Sonobe, Tomohiro. "An Experimental Survey of Extended Resolution Effects for SAT Solvers on the Pigeonhole Principle." Algorithms 15, no. 12 (2022): 479. http://dx.doi.org/10.3390/a15120479.

Pełny tekst źródła
Streszczenie:
It has been proven that extended resolution (ER) has more powerful reasoning than general resolution for the pigeonhole principle in Cook’s paper. This fact indicates the possibility that a solver based on extended resolution can exceed Boolean satisfiability problem solvers (SAT solvers for short) based on general resolution. However, few studies have provided practical evidence of this assumption. This paper explores how extended resolution can improve SAT solvers by using the pigeonhole principle, which was the first problem solved by ER in polynomial steps. In fact, although Cook’s paper i
Style APA, Harvard, Vancouver, ISO itp.
9

Poesen, Michiel. "Contracts, Pigeonholes and Irish-Bulgarian Connections. Cross-Border Litigation on Property Service Charges: Kerr v Postnov and Postnova." Edinburgh Law Review 24, no. 1 (2020): 82–88. http://dx.doi.org/10.3366/elr.2020.0602.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Russell, Nerissa. "The Wild Side of Animal Domestication." Society & Animals 10, no. 3 (2002): 285–302. http://dx.doi.org/10.1163/156853002320770083.

Pełny tekst źródła
Streszczenie:
AbstractThis paper examines not the process but the concept of nonhuman animal domestication. Domestication involves both biological and cultural components. Creating a category of domestic animals means constructing and crossing the boundaries between human and animal, culture and nature. The concept of domestication thus structures the thinking both of researchers in the present and of domesticators and herders in the past. Some have argued for abandoning the notion of domestication in favor of a continuum of human-nonhuman animal relationships. Although many human-animal relationships canno
Style APA, Harvard, Vancouver, ISO itp.
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii